Capacity-Achieving Private Information Retrieval Schemes From Uncoded Storage Constrained Servers With Low Sub-Packetization

DOI10.1109/TIT.2021.3087425zbMath1486.94055arXiv2102.08058OpenAlexW3166939522MaRDI QIDQ4958236

Ying Miao, Qifa Yan, Jinbao Zhu, Xiaohu Tang

Publication date: 7 September 2021

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.08058

zbMATH Keywords

reduction of sub-packetization of capacity-achieving schemesstorage design arrayuncoded storage constrained private information retrieval systems

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Source coding (94A29)

This page was built for publication: Capacity-Achieving Private Information Retrieval Schemes From Uncoded Storage Constrained Servers With Low Sub-Packetization