The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
3-Query Locally Decodable Codes of Subexponential Length
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Chor, B., Kushilevitz, E., Goldreich, O., & Sudan, M. (1998) · Journal of the ACM · doi:10.1145/293347.293350 · Cited by 1,612
Towards 3-query locally decodable codes of subexponential length
Yekhanin, S. (2008) · Journal of the ACM · doi:10.1145/1326554.1326555 · Cited by 440
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
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
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
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
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
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
Function Secret Sharing: Improvements and Extensions
Boyle, E., Gilboa, N., & Ishai, Y. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978429 · Cited by 358
Boyle, E., Gilboa, N., & Ishai, Y. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46803-6_12 · Cited by 328
Introduction to Property Testing
Goldreich, O. (2017) · Cambridge University Press eBooks · doi:10.1017/9781108135252 · Cited by 270
Quantum proofs for classical theorems
(2011) · Theory of Computing · doi:10.4086/toc.gs.2011.002 · Cited by 41
Metadata
- Authors
- Efremenko, K.
- Venue
- SIAM Journal on Computing
- Published
- 2012-01
- Volume
- 41
- Issue
- 6
- Pages
- 1694-1703
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W284999918
- Cited by
- 256
- References
- 9
- FWCI
- 20.24
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: 3-Query Locally Decodable Codes of Subexponential Length. https://app.cochat.ai/papers/10.1137/090772721
- The paper
- Efremenko, K. (2012). 3-Query Locally Decodable Codes of Subexponential Length. SIAM Journal on Computing. https://doi.org/10.1137/090772721
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.