Sökning: id:"swepub:oai:research.chalmers.se:f967f5a3-043c-4b72-8311-134ffa935d34" >
Improved Private In...
Improved Private Information Retrieval for Coded Storage From Code Decomposition
-
- Lin, H.-Y. (författare)
- Simula UiB
-
- Kumar, Siddhartha, 1991 (författare)
- Simula UiB
-
- Rosnes, Eirik (författare)
- Simula UiB
-
visa fler...
-
- Graell I Amat, Alexandre, 1976 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology,Simula UiB
-
visa färre...
-
(creator_code:org_t)
- ISBN 9781538669006
- 2019
- 2019
- Engelska.
-
Ingår i: 2019 IEEE Information Theory Workshop, ITW 2019. - 9781538669006 ; , s. 729-733
- Relaterad länk:
-
https://research.cha... (primary) (free)
-
visa fler...
-
https://research.cha...
-
https://research.cha...
-
https://doi.org/10.1...
-
https://research.cha...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Telekommunikation (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Telecommunications (hsv//eng)
Publikations- och innehållstyp
- kon (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas