Improved Private Information Retrieval for Coded Storage From Code Decomposition
Paper i proceeding, 2019

We consider private information retrieval (PIR) for distributed storage systems with noncolluding nodes where data is stored using a non maximum distance separable (MDS) linear code. Recently, it was shown that when data is stored using certain non-MDS codes, the MDS-PIR capacity can be achieved, and is indeed the capacity of the system. In this paper, for storage codes not belonging to this class, we present a heuristic algorithm for their decomposition into punctured subcodes and a PIR protocol based on these punctured subcodes. The code decomposition is guided by the generalized Hamming weights of the storage code. We show that the proposed PIR protocol can achieve a larger PIR rate than that of all existing PIR protocols.

Författare

H.-Y. Lin

Simula UiB

Siddhartha Kumar

Simula UiB

Eirik Rosnes

Simula UiB

Alexandre Graell I Amat

Chalmers, Elektroteknik, Kommunikations- och antennsystem, Kommunikationssystem

Simula UiB

IEEE Information Theory Workshop

729-733

IEEE Information Theory Workshop (ITW). Invited paper
Visby, Sweden,

Distribuerad lagring för datalagring och trådlös leverans av data

Vetenskapsrådet (VR), 2016-01-01 -- 2019-12-31.

Ämneskategorier

Telekommunikation

DOI

10.1109/ITW44776.2019.8989190

ISBN

9781538669006

Mer information

Senast uppdaterat

2020-11-03