Local Reconstruction Codes: A Class of MDS-PIR Capacity-Achieving Codes

2018/09/18 by Kumar, Siddhartha, Lin, Hsuan-Yin, Rosnes, Eirik +1
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1809.06648

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.

Related

• Some results on locally repairable codes with minimum distance 7 and locality 2
• Private Information Retrieval from Locally Repairable Databases with Colluding Servers
• Two-layer Locally Repairable Codes for Distributed Storage Systems
• Optimal Locally Repairable Codes via Rank-Metric Codes
• Some Improvements on Locally Repairable Codes