The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Towards 3-query locally decodable codes of subexponential length
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 x i 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( O ( n 1/ t )), for every n . Based on the largest known Mersenne prime, this translates to a length of less than exp( O ( n 10 − 7 )) compared to exp( O ( n 1/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 (1/log log n ) ) for infinitely many n . We also obtain analogous improvements for Private Information Retrieval (PIR) schemes. We give 3-server PIR schemes with communication complexity of O ( n 10 − 7 ) to access an n -bit database, compared to the previous best scheme with complexity O ( n 1/5.25 ). Assuming again that there are infinitely many Mersenne primes, we get 3-server PIR schemes of communication complexity n O (1/log log n ) ) for infinitely many n . Previous families of LDCs and PIR schemes were based on the properties of low-degree multivariate polynomials over finite fields. Our constructions are completely different and are obtained by constructing a large number of vectors in a small dimensional vector space whose inner products are restricted to lie in an algebraically nice set.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Lidl, R. (1983) · Cited by 1,390
Chor, B., Goldreich, O., Kushilevitz, E., & Sudan, M. (2002) · Proceedings of IEEE 36th Annual Foundations of Computer Science · doi:10.1109/sfcs.1995.492461 · Cited by 1,116
Checking computations in polylogarithmic time
Babai, L., Fortnow, L., Levin, L. A., & Szegedy, M. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103428 · Cited by 616
On the efficiency of local decoding procedures for error-correcting codes
Katz, J., & Trevisan, L. (2000) · Proceedings of the thirty-second annual ACM symposium on Theory of computing · doi:10.1145/335305.335315 · Cited by 264
Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval
Beimel, A., Ishai, Y., Kushilevitz, E., & Raymond, J.-F. (2003) · The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. · doi:10.1109/sfcs.2002.1181949 · Cited by 218
A Survey on Private Information Retrieval
Gasarch, W. I. (2004) · Cited by 207
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Kerenidis, I., & de Wolf, R. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780560 · Cited by 194
Nearly-linear size holographic proofs
Polishchuk, A., & Spielman, D. A. (1994) · Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 · doi:10.1145/195058.195132 · Cited by 191
Upper bound on the communication complexity of private information retrieval
Ambainis, A. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63165-8_196 · Cited by 172
Some Applications of Coding Theory in Computational ComplexityPreprint
Trevisan, L. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0409044 · Cited by 147
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Kerenidis, I., & de Wolf, R. (2004) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2004.04.007 · Cited by 134
Lower bounds for linear locally decodable codes and private information retrieval
Goldreich, O., Karloff, H. J., Schulman, L. J., & Trevisan, L. (2003) · Computational Complexity · doi:10.1007/s00037-006-0216-3 · Cited by 129
General constructions for information-theoretic private information retrieval
Beimel, A., Ishai, Y., & Eyal Kushilevitz, Z. (2005) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2005.03.002 · Cited by 107
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
Sudan, M. (1996) · Cited by 82
New Lower Bounds for General Locally Decodable Codes.Preprint
Woodruff, D. P. (2007) · Electronic colloquium on computational complexity · Cited by 76
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
Wehner, S., & de Wolf, R. (2005) · Lecture notes in computer science · doi:10.1007/11523468_115 · Cited by 69
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
Wehner, S., & de Wolf, R. (2004) · Data Archiving and Networked Services (DANS) · Cited by 69
Cited by
On the Locality of Codeword Symbols
Gopalan, P., Huang, C., Simitci, H., & Yekhanin, S. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2208937 · Cited by 831
Self-citation3-Query Locally Decodable Codes of Subexponential Length
Efremenko, K. (2012) · SIAM Journal on Computing · doi:10.1137/090772721 · Cited by 256
Quantum proofs for classical theorems
(2011) · Theory of Computing · doi:10.4086/toc.gs.2011.002 · Cited by 41
Metadata
- Authors
- Yekhanin, S.
- Venue
- Journal of the ACM
- Published
- 2008-02
- Volume
- 55
- Issue
- 1
- Pages
- 1-16
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W1998698985
- Cited by
- 440
- References
- 18
- FWCI
- 60.95
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.