arXiv Analytics

Sign in

arXiv:1808.09018 [cs.IT]AbstractReferencesReviewsResources

On the Fundamental Limit of Private Information Retrieval for Coded Distributed Storage

Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat

Published 2018-08-27Version 1

We consider private information retrieval (PIR) for distributed storage systems (DSSs) with noncolluding nodes where data is stored using a non maximum distance separable (MDS) linear code. It was recently shown that if data is stored using a particular class of non-MDS linear codes, the MDS-PIR capacity, i.e., the maximum possible PIR rate for MDS-coded DSSs, can be achieved. For this class of codes, we prove that the PIR capacity is indeed equal to the MDS-PIR capacity, giving the first family of non-MDS codes for which the PIR capacity is known. For other codes, we provide asymmetric PIR protocols that achieve a strictly larger PIR rate compared to existing symmetric PIR protocols.

Comments: This work is the extended version of the paper at arXiv:1806.01342v1 [cs.IT]. Conference version of this paper will be presented at 2018 IEEE Information Theory Workshop
Categories: cs.IT, math.IT
Related articles: Most relevant | Search more
arXiv:1908.10854 [cs.IT] (Published 2019-08-28)
$X$-secure $T$-private Information Retrieval from MDS Coded Storage with Byzantine and Unresponsive Servers
arXiv:1901.02938 [cs.IT] (Published 2019-01-09)
Private Information Retrieval from Locally Repairable Databases with Colluding Servers
arXiv:2401.15910 [cs.IT] (Published 2024-01-29, updated 2024-08-11)
Correction to "Private Information Retrieval Over Gaussian MAC"