期刊
SIAM JOURNAL ON COMPUTING
卷 41, 期 6, 页码 1694-1703出版社
SIAM PUBLICATIONS
DOI: 10.1137/090772721
关键词
locally decodable codes; private information retrieval
资金
- Adams Fellowship Program of the Israel Academy of Sciences and Humanities
- Israel Science Foundation
- Wolfson Family Charitable Trust
Locally decodable codes (LDCs) allow one to decode any particular symbol of the input message by making a constant number of queries to a codeword, even if a constant fraction of the codeword is damaged. In a recent work [J. ACM, 55 (2008), article 1], Yekhanin constructs a 3-query LDC with subexponential length. However, this construction requires a conjecture that there are infinitely many Mersenne primes. In this paper, we give the first unconditional constant query LDC construction with subexponential codeword length. In addition, our construction reduces codeword length.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据