Title data
Kurz, Sascha ; Yaakobi, Eitan:
PIR Codes with Short Block Length.
Bayreuth
,
2020
.  10 S.


Download (289kB)

Abstract
In this work private information retrieval (PIR) codes are studied. In a kPIR 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.
Further data
Item Type:  Preprint, postprint 

Keywords:  private information retrieval; PIR codes; coding theory; privacy 
Subject classification:  Mathematics Subject Classification Code: 68P30 
DDC Subjects:  000 Computer Science, information, general works > 004 Computer science 500 Science > 510 Mathematics 
Institutions of the University:  Faculties > Faculty of Mathematics, Physics und Computer Science Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematical Economics Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematical Economics > Chair Mathematical Economics  Univ.Prof. Dr. Jörg Rambau Faculties 
Language:  English 
Originates at UBT:  Yes 
URN:  urn:nbn:de:bvb:703epub45781 
Date Deposited:  13 Jan 2020 07:20 
Last Modified:  13 Jan 2020 07:20 
URI:  https://epub.unibayreuth.de/id/eprint/4578 