论文标题
长度短的PIR代码
PIR Codes with Short Block Length
论文作者
论文摘要
在这项工作中，研究了私人信息检索（PIR）代码。在$ K $ - PIRPIR代码中，$ S $信息位的编码方式是每个信息位具有$ K $互机恢复集的方式。此范式下的主要问题是在给定$ s $和$ k $的值的情况下最小化编码位的数量，其中此值用$ p（s，k）$表示。这项工作的主要重点是分析$ p（s，k）$的$ s $和$ k $的大量参数。特别是，我们改进了有关此值的几个现有结果。
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.
