PIR Codes with Short Block Length
arXiv:2001.03433 · doi:10.1007/s10623-020-00828-6
Abstract
In this work private information retrieval (PIR) codes are studied. In a -PIR code, information bits are encoded in such a way that every information bit has mutually disjoint recovery sets. The main problem under this paradigm is to minimize the number of encoded bits given the values of and , where this value is denoted by . The main focus of this work is to analyze for a large range of parameters of and . In particular, we improve upon several of the existing results on this value.
arXiv comment10 pages, 1 table
References in corpus (6)
- Locally Repairable Codes with Multiple Repair Alternatives
- PIR with Low Storage Overhead: Coding instead of Replication
- Lower Bound on the Redundancy of PIR Codes
- Lengthening and Extending Binary Private Information Retrieval Codes
- LinCode -- computer classification of linear codes
- Notes on Reed-Muller Codes