Pith. sign in

REVIEW 1 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1808.09018 v1 pith:4YPY6MZX submitted 2018-08-27 cs.IT math.IT

classification cs.ITmath.IT
keywords capacitycodesclassdatadistributeddsssinformationlinear
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding

    cs.IT 2019-08 conditional novelty 6.0 of 10

    Joint encoding of messages in MDS-coded storage can strictly increase private information retrieval rates beyond the separate-coding capacity for two parametric families of systems.

Pith tools