Local Reconstruction Codes: A Class of MDS-PIR Capacity-Achieving Codes
Information Theory
2018-09-19 v1 math.IT
Abstract
We prove that a class of distance-optimal local reconstruction codes (LRCs), an important family of repair-efficient codes for distributed storage systems, achieve the maximum distance separable private information retrieval capacity for the case of noncolluding nodes. This particular class of codes includes Pyramid codes and other LRCs proposed in the literature.
Cite
@article{arxiv.1809.06648,
title = {Local Reconstruction Codes: A Class of MDS-PIR Capacity-Achieving Codes},
author = {Siddhartha Kumar and Hsuan-Yin Lin and Eirik Rosnes and Alexandre Graell i Amat},
journal= {arXiv preprint arXiv:1809.06648},
year = {2018}
}
Comments
The contents of this manuscript is extracted from arXiv:1712.03898, and will be presented at the IEEE Information Theory Workshop (ITW), 2018