2020/01/10 by Sascha Kurz, Eitan Yaakobi
Computer Science · Engineering · Mathematics · #Advanced Data Storage Technologies #Algorithm #Arithmetic #Block (permutation group theory) #Code (set theory) #Coding theory and cryptography #Combinatorics #Computer science #Computer security #Cryptography and Data Security #Discrete mathematics #Disjoint sets #Engineering #Focus (optics) #Mathematics #Physics #Private information retrieval #Programming language #Range (aeronautics) #Set (abstract data type) #Theoretical computer science #Value (mathematics) #acm:68P30 #cs.IT #math.CO #math.IT #msc:68P30
paper · pdf · doi:10.1007/s10623-020-00828-6
10 pages, 1 table
arxiv created 2020/01/10 · openalex publication_date 2021/01/17 · arxiv updated 2021/01/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
In this work private information retrieval (PIR) codes are studied. In a k-PIR code, s information bits are encoded in such a way that every information bit has k mutually disjoint recovery sets. The main problem under this paradigm is to minimize the number of encoded bits given the values of s and k, where this value is denoted by P(s,k). The main focus of this work is to analyze P(s,k) for a large range of parameters of s and k. In particular, we improve upon several of the existing results on this value.