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

09/18/2018
by   Siddhartha Kumar, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/04/2018

Asymmetry Helps: Improved Private Information Retrieval Protocols for Distributed Storage

We consider private information retrieval (PIR) for distributed storage ...
research
08/27/2018

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

We consider private information retrieval (PIR) for distributed storage ...
research
12/07/2017

t-Private Information Retrieval Schemes Using Transitive Codes

This paper presents private information retrieval (PIR) schemes for code...
research
08/22/2018

Capacity-Achieving Private Information Retrieval Codes with Optimal Message Size and Upload Cost

We propose a new capacity-achieving code for the private information ret...
research
04/09/2023

A Proof of a Conjecture About a Class of Near Maximum Distance Separable Codes

In this paper, we completely determine the number of solutions to Tr^q^2...
research
12/20/2019

Analyzing the Download Time of Availability Codes

Availability codes have recently been proposed to facilitate efficient s...
research
01/12/2019

On the PIR capacity of MSR codes

We consider the problem of private information retrieval (PIR) from mult...

Please sign up or login with your details

Forgot password? Click here to reset