2021
DOI: 10.1007/s10623-020-00828-6
|View full text |Cite
|
Sign up to set email alerts
|

PIR Codes with Short Block Length

Abstract: 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.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
references
References 20 publications
0
0
0
Order By: Relevance