3-Query locally decodable codes of subexponential length

Research output: Contribution to journalArticlepeer-review

81 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)1694-1703
Number of pages10
JournalSIAM Journal on Computing
Volume41
Issue number6
DOIs
StatePublished - 31 Dec 2012
Externally publishedYes

Keywords

  • Locally decodable codes
  • Private information retrieval

ASJC Scopus subject areas

  • General Computer Science
  • General Mathematics

Fingerprint

Dive into the research topics of '3-Query locally decodable codes of subexponential length'. Together they form a unique fingerprint.

Cite this