## Towards 3-query locally decodable codes of subexponential length (2007)

Venue: | In Proc. of the 39th ACM Symposium on Theory of Computing (STOC |

Citations: | 49 - 5 self |

### BibTeX

@INPROCEEDINGS{Yekhanin07towards3-query,

author = {Sergey Yekhanin},

title = {Towards 3-query locally decodable codes of subexponential length},

booktitle = {In Proc. of the 39th ACM Symposium on Theory of Computing (STOC},

year = {2007},

pages = {266--274},

publisher = {ACM Press}

}

### OpenURL

### Abstract

A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only q bits of the codeword C(x), even after some constant fraction of codeword bits has been corrupted. We give new constructions of three query LDCs of vastly shorter length than that of previous constructions. Specifically, given any Mersenne prime p = 2 t − 1, we design three query LDCs of length N = exp � n 1/t �, for every n. Based on the largest known Mersenne prime, this translates to a length of less than exp n 10−7� compared to exp � n1/2 � in the previous constructions. It has often been conjectured that there are infinitely many Mersenne�primes. Under this conjecture, our constructions yield three query locally decodable codes of length N = exp n O

### Citations

527 |
Finite Fields
- Lidl, Niederreiter
- 1984
(Show Context)
Citation Context ...construct 3-algebraically nice subsets of F∗ p, for primes p that have the form p = 2t − 1. Such primes are known as Mersenne primes. Our construction relies on some basic properties of finite fields =-=[17]-=-. Consider a natural one to one correspondence between subsets S1 of Fp and polynomials φS1 (x) in the ring F2[x]/(xp − 1) : � φS1 (x) = x s . It is immediate to verify that for all sets S1 ⊆ Fp and a... |

418 | Private Information Retrieval
- Chor, Goldreich, et al.
- 1998
(Show Context)
Citation Context ... interest in a PIR scheme is its communication complexity Cq(n), namely the number of bits exchanged by the user and the servers. Private information retrieval schemes were introduced by Chor et. al. =-=[7]-=-. Further work on PIRs includes [1, 18, 13, 14, 5, 12, 16, 2, 31, 23]. Below is a brief summary of known bounds for Cq(n). The best upper bound for C2(n) is O(n 1/3 ) due to [7]. The best upper bounds... |

260 | Checking computations in polylogarithmic time
- Babai, Fortnow, et al.
- 1991
(Show Context)
Citation Context ...ery complexity q. Ideally we would like to have both of them as small as possible. The notion of locally decodable codes was explicitly discussed in various places in the early 1990s, most notably in =-=[3, 24, 21]-=-. Katz and Trevisan [15] were the first to provide a formal definition of LDCs and prove lower bounds on their length. Further work on locally decodable codes includes [5, 8, 20, 6, 16, 26]. The lengt... |

123 | Exponential lower bound for 2-query locally decodable codes via a quantum argument
- Kerenidis, Wolf
- 2003
(Show Context)
Citation Context ...90s, most notably in [3, 24, 21]. Katz and Trevisan [15] were the first to provide a formal definition of LDCs and prove lower bounds on their length. Further work on locally decodable codes includes =-=[5, 8, 20, 6, 16, 26]-=-. The length of optimal 2-query LDCs was settled by Kerenidis and de Wolf in [16] and is exp(n). 1 The length of optimal 3-query LDCs is unknown. The best upper bound prior to our work was exp � n 1/2... |

121 |
On the efficiency of local decoding procedures for error-correcting codes
- Katz, Trevisan
- 2000
(Show Context)
Citation Context ...uld like to have both of them as small as possible. The notion of locally decodable codes was explicitly discussed in various places in the early 1990s, most notably in [3, 24, 21]. Katz and Trevisan =-=[15]-=- were the first to provide a formal definition of LDCs and prove lower bounds on their length. Further work on locally decodable codes includes [5, 8, 20, 6, 16, 26]. The length of optimal 2-query LDC... |

89 | An upper bound on the communication complexity of private information retrieval
- Ambainis
- 1997
(Show Context)
Citation Context ...mmunication complexity Cq(n), namely the number of bits exchanged by the user and the servers. Private information retrieval schemes were introduced by Chor et. al. [7]. Further work on PIRs includes =-=[1, 18, 13, 14, 5, 12, 16, 2, 31, 23]-=-. Below is a brief summary of known bounds for Cq(n). The best upper bound for C2(n) is O(n 1/3 ) due to [7]. The best upper bounds for larger values of q are Cq(n) ≤ n O(log log q/(q log q)) due to B... |

82 |
Nearly-linear size holographic proofs
- Polishchuk, Spielman
- 1994
(Show Context)
Citation Context ...ery complexity q. Ideally we would like to have both of them as small as possible. The notion of locally decodable codes was explicitly discussed in various places in the early 1990s, most notably in =-=[3, 24, 21]-=-. Katz and Trevisan [15] were the first to provide a formal definition of LDCs and prove lower bounds on their length. Further work on locally decodable codes includes [5, 8, 20, 6, 16, 26]. The lengt... |

70 | Efficient checking of polynomials and proofs and the hardness of approximation problems
- Sudan
- 1992
(Show Context)
Citation Context ...ery complexity q. Ideally we would like to have both of them as small as possible. The notion of locally decodable codes was explicitly discussed in various places in the early 1990s, most notably in =-=[3, 24, 21]-=-. Katz and Trevisan [15] were the first to provide a formal definition of LDCs and prove lower bounds on their length. Further work on locally decodable codes includes [5, 8, 20, 6, 16, 26]. The lengt... |

47 | Breaking the O(n 1/(2k−1) ) barrier for information-theoretic private information retrieval
- Beimel, Ishai, et al.
- 2002
(Show Context)
Citation Context ...90s, most notably in [3, 24, 21]. Katz and Trevisan [15] were the first to provide a formal definition of LDCs and prove lower bounds on their length. Further work on locally decodable codes includes =-=[5, 8, 20, 6, 16, 26]-=-. The length of optimal 2-query LDCs was settled by Kerenidis and de Wolf in [16] and is exp(n). 1 The length of optimal 3-query LDCs is unknown. The best upper bound prior to our work was exp � n 1/2... |

44 | Private access to distributed information
- Mann
- 1998
(Show Context)
Citation Context ...mmunication complexity Cq(n), namely the number of bits exchanged by the user and the servers. Private information retrieval schemes were introduced by Chor et. al. [7]. Further work on PIRs includes =-=[1, 18, 13, 14, 5, 12, 16, 2, 31, 23]-=-. Below is a brief summary of known bounds for Cq(n). The best upper bound for C2(n) is O(n 1/3 ) due to [7]. The best upper bounds for larger values of q are Cq(n) ≤ n O(log log q/(q log q)) due to B... |

36 |
New lower bounds for general locally decodable codes
- Woodruff
- 2006
(Show Context)
Citation Context ...de Wolf in [16] and is exp(n). 1 The length of optimal 3-query LDCs is unknown. The best upper bound prior to our work was exp � n 1/2� due to Beimel et al. [5], and the best lower bound is ˜ Ω(n 2 ) =-=[16, 30]-=-. For general (constant) q the best upper bound was exp � n O(log log q/(q log q))� due to Beimel et al. [6] and the best lower bound is ˜ Ω � n 1+1/(⌈q/2⌉−1)� [16, 30]. The current state of knowledge... |

29 | Improved lower bounds for locally decodable codes and private information retrieval
- Wehner, Wolf
- 2005
(Show Context)
Citation Context ...90s, most notably in [3, 24, 21]. Katz and Trevisan [15] were the first to provide a formal definition of LDCs and prove lower bounds on their length. Further work on locally decodable codes includes =-=[5, 8, 20, 6, 16, 26]-=-. The length of optimal 2-query LDCs was settled by Kerenidis and de Wolf in [16] and is exp(n). 1 The length of optimal 3-query LDCs is unknown. The best upper bound prior to our work was exp � n 1/2... |

24 | Optimal lower bounds for 2-query locally decodable linear codes
- Obata
- 2002
(Show Context)
Citation Context |

21 |
Better lower bounds for locally decodable codes
- Deshpande, Jain, et al.
- 2002
(Show Context)
Citation Context |

17 |
Divisors of Mersenne numbers
- Wagstaff
- 1983
(Show Context)
Citation Context ...lds, our constructions yield three query locally decodable codes of length N = exp n O � �� 1 log log n for infinitely many n. Finally, assuming that the conjecture of Lenstra, Pomerance and Wagstaff =-=[27, 22, 28]-=- regarding the density � of Mersenne primes holds, our constructions yield three query locally decodable codes of length N = exp n O � 1 log1−ɛ �� log n for all n, for every ɛ > 0. 1.1 Application to ... |

11 |
A geometric approach to information theoretic private information retrieval
- Woodruff, Yekhanin
- 2005
(Show Context)
Citation Context ...mmunication complexity Cq(n), namely the number of bits exchanged by the user and the servers. Private information retrieval schemes were introduced by Chor et. al. [7]. Further work on PIRs includes =-=[1, 18, 13, 14, 5, 12, 16, 2, 31, 23]-=-. Below is a brief summary of known bounds for Cq(n). The best upper bound for C2(n) is O(n 1/3 ) due to [7]. The best upper bounds for larger values of q are Cq(n) ≤ n O(log log q/(q log q)) due to B... |

10 | GASARCH: A tight lower bound for restricted PIR protocols
- BEIGEL, FORTNOW, et al.
(Show Context)
Citation Context |

10 |
Lower bounds for locally decodable codes and private information retrieval
- Goldreich, Karloff, et al.
- 2002
(Show Context)
Citation Context |

10 |
On Lower Bound for the Communication Complexity of Private Information Retrieval
- Itoh
- 2001
(Show Context)
Citation Context |

8 |
A survey on private information retrieval. Bulletin of the European Association for The European Association for Theoretical Computer
- Gasarch
(Show Context)
Citation Context ...able Codes and Private Information Retrieval Schemes”.sof C(x), where q can be as small as 2. Locally decodable codes have found numerous applications in complexity theory and cryptography. See [25], =-=[10]-=- for a survey. Below is a slightly informal definition of LDCs: A (q, δ, ɛ)-locally decodable code encodes n-bit strings to N-bit codewords C(x), such that for every i ∈ [n], the bit xi can be recover... |

7 | On the largest prime factor of a Mersenne number’, Number theory CRM - Murata, Pomerance - 2004 |

7 |
Recent developments in primality testing
- Pomerance
(Show Context)
Citation Context ...lds, our constructions yield three query locally decodable codes of length N = exp n O � �� 1 log log n for infinitely many n. Finally, assuming that the conjecture of Lenstra, Pomerance and Wagstaff =-=[27, 22, 28]-=- regarding the density � of Mersenne primes holds, our constructions yield three query locally decodable codes of length N = exp n O � 1 log1−ɛ �� log n for all n, for every ɛ > 0. 1.1 Application to ... |

7 |
Some Applications of Coding Theory in
- Trevisan
- 2004
(Show Context)
Citation Context ... Decodable Codes and Private Information Retrieval Schemes”.sof C(x), where q can be as small as 2. Locally decodable codes have found numerous applications in complexity theory and cryptography. See =-=[25]-=-, [10] for a survey. Below is a slightly informal definition of LDCs: A (q, δ, ɛ)-locally decodable code encodes n-bit strings to N-bit codewords C(x), such that for every i ∈ [n], the bit xi can be r... |

6 | An Ω(n 1/3 ) Lower Bounds for Bilinear Group Based Private Information Retrieval
- Razborov, Yekhanin
- 2006
(Show Context)
Citation Context |

5 | Kushilevitz,“General constructions for information-theoretic private information retrieval
- Beimel, Ishai, et al.
- 2005
(Show Context)
Citation Context |

3 | Short locally testable codes and proofs - Goldreich - 2005 |

3 |
Efficient private information retrieval,” IEICE Trans
- Itoh
- 1999
(Show Context)
Citation Context |