Fetching the paper…
Reading the bibliography…
An explicit construction of locally testable codes of constant rate, constant distance and constant number of queries is given.
Richard W. Hamming. ”Error Detecting and Error Correcting Codes”. Bell System Technical Journal, 29: 147–160, 1950
1950
Earlier work this paper cites.
Edgar N Gilbert. ”A comparison of signalling alphabets”. The Bell system technical journal, 31.3: 504–522, 1952
1952
Earlier work this paper cites.
Rom Rubenovich Varshamov. ”Estimate of the number of signals in error correcting codes”. Docklady Akad. Nauk, SSSR, 117: 739–741, 1957
1957
Earlier work this paper cites.
Robert G. Gallager. ”Low Density Parity Check Codes”. MIT Press, Cambridge, Massachusetts, 1963
1963
Earlier work this paper cites.
David A. Kazhdan. ”Connection of the dual space of a group with the structure of its close subgroups”. Functional analysis and its applications, 1.1: 63-65, 1967
1967
Earlier work this paper cites.
Howard Garland. ”p-adic curvature and the cohomology of discrete subgroups of p-adic groups”. Annals of Mathematics, 97: 375, 1973
1973
Earlier work this paper cites.
Florence Jessie MacWilliams and Neil James Alexander Sloane. ”The theory of error correcting codes.” Vol. 16. Elsevier, 1977
1977
Earlier work this paper cites.
Shing-Tung Yau. ”Calabi’s conjecture and some new results in algebraic geometry”. Proceedings of the National Academy of Sciences, 74.5: 1798-1799, 1977
1977
Earlier work this paper cites.
David Mumford. ”An algebraic surface with K K ample, ( K 2 ) = 9 (K^{2})=9 , p g = q = 0 p_{g}=q=0 ”. American Journal of Mathematics, 101.1: 233-244, 1979
1979
Earlier work this paper cites.
R. Michael Tanner. ”A recursive approach to low complexity codes”. IEEE Transactions on Information Theory, 27: 533–547, 1981
1981
Earlier work this paper cites.
Christian Thommesen. ”The existence of binary linear concatenated codes with reed-solomon outer codes which asymptotically meet the Gilbert- Varshamov bound”. IEEE transactions on information theory, 29.6: 850– 853, 1983
1983
Earlier work this paper cites.
Noga Alon and Fan RK Chung. ”Explicit construction of linear sized tolerant networks”. Discrete Mathematics, 72.1: 15-19, 1988
1988
Earlier work this paper cites.
Alexander Lubotzky, Ralph Phillips and Peter Sarnak. ”Ramanujan graphs”. Combinatorica, 8: 261–277, 1988
1988
Earlier work this paper cites.
Manuel Blum, Michael Luby and Ronitt Rubinfeld. ”Self-testing/correcting with applications to numerical problems”. Proceedings of 23rd ACM Symposium on Theory of Computing, 73–83, 1990
1990
Earlier work this paper cites.
László Babai, Lance Fortnow, Leonid Levin and Mario Szegedy. ”Checking computations in polylogarithmic time”. Proceedings of 23rd ACM Symposium on Theory of Computing, 21–31, 1991
1991
Earlier work this paper cites.
Shahar Mozes. ”A zero entropy, mixing of all orders tiling system, symbolic dynamics and its applications”. Contemporary Mathematics, 135: 319–325, 1991
1991
Cited alongside, same era.
Sanjeev Arora. ”Probabilistic checking of proofs and the hardness of approximation problems”. PhD thesis, U.C. Berkeley, 1994
1994
Cited alongside, same era.
Noga Alon, Jeff Edmonds and Michael Luby. ”Linear time erasure codes with nearly optimal recovery”. Proceedings of IEEE 36th Annual Foundations of Computer Science, 512–519, 1995
1995
Cited alongside, same era.
Ronitt Rubinfeld and Madhu Sudan. ”Robust characterizations of polynomials with applications to program testing”. SIAM Journal of Computation, 25.2: 252–271, 1996
1996
Cited alongside, same era.
Michael Sipser and Daniel Spielman. ”Expander codes”. IEEE Transactions on Information Theory, 42.6: 1710–1722, 1996
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan and Michael Viderman. ”Locally testable codes require redundant testers”. SIAM Journal on Computing, 39.7: 3230-3247, 2010
2010
Later among the works it cites.
Oded Goldreich. ”Short Locally Testable Codes and Proofs: A Survey in Two Parts”. Property Testing: Current Research and Surveys, Springer, Berlin, 65–104, 2010
2010
Later among the works it cites.
Alexander Lubotzky. ”Ramanujan complexes and high dimensional expanders”. Japanese Journal of Mathematics, 9.2: 137-169, 2014
2014
Later among the works it cites.
Michael Rapoport and Thomas Zink. ”Period Spaces for p-divisible Groups”. Princeton University Press (AM-141), Vol. 141, 2016
2016
Later among the works it cites.
Swastik Kopparty, Or Meir, Noga Ron-Zewi and Shubhangi Saraf. ”High-rate locally correctable and locally testable codes with sub-polynomial query complexity”. Journal of the ACM, 64.2: 1-42, 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
1996
Cited alongside, same era.
Yakov Varshavsky. ”p-adic uniformization of unitary Shimura varieties”. Publications Mathématiques de l’Institut des Hautes Études Scientifiques, 87.1: 57-119, 1998
1998
Cited alongside, same era.
Bruce W. Jordan and Ron Livne. ”The Ramanujan property for regular cubical complexes”. Duke Mathematical Journal, 105.1: 85-103, 2000
2000
Cited alongside, same era.
Eli Ben-Sasson, Prahladh Harsha and Sofya Raskhodnikova. ”Some 3CNF properties are hard to test”. SIAM Journal on Computing, 35.1: 1–21, 2005
2005
Cited alongside, same era.
Oded Goldreich. ”Short locally testable codes and proofs (survey)”. ECCC Technical Report, TR05-014, 2005
2005
Cited alongside, same era.
Alexander Lubotzky, Beth Samuels and Uzi Vishne. ”Ramanujan complexes of type A ~ d \tilde{A}_{d} ”. Israel Journal of Mathematics, 149.1: 267–299, 2005
2005
Cited alongside, same era.
Alexander Lubotzky, Beth Samuels, and Uzi Vishne. ”Explicit constructions of Ramanujan complexes of type A ~ d \tilde{A}_{d} ”. European Journal of Combinatorics, 26.6: 965–993, 2005
2005
Cited alongside, same era.
Eli Ben-Sasson and Madhu Sudan. ”Robust locally testable codes and products of codes”. Random Structures & Algorithms, 28(4):387–402, 2006
2006
Cited alongside, same era.
2017
Later among the works it cites.
Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, and Shubhangi Saraf. ”Locally testable and locally correctable codes approaching the Gilbert-Varshamov bound”. IEEE Transactions on Information Theory, 64.8: 5813–5831, 2018
2018
Later among the works it cites.
Izhar Oppenheim. ”Local spectral expansion approach to high dimensional expanders part I: Descent of spectral gaps”. Discrete & Computational Geometry, 59.2: 293-330, 2018
2018
Later among the works it cites.
Konstantin Golubev and Ori Parzanchevski, ”Spectrum and combinatorics of two-dimensional Ramanujan complexes”. Israel Journal of Mathematics, 230.2: 583-612, 2019
2019
Later among the works it cites.
Yotam Dikstein, Irit Dinur, Prahladh Harsha and Boga Ron-Zewi, ”Locally testable codes via high-dimensional expanders”. Electronic colloquium on computational complexity, 27.72, 2020
2020
Later among the works it cites.
Noga Alon. ”Explicit expanders of every degree and size.” Combinatorica 41.4 (2021): 447-463
2021
Later among the works it cites.
Nikolas P. Breuckmann and Jens N. Eberhardt. “Balanced product quantum codes”. IEEE Transactions on Information Theory, 67.10: 6653–6674, 2021
2021
Later among the works it cites.
Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky and Shahar Mozes. ”Locally Testable Codes with constant rate, distance, and locality”. Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 357-374, 2022
2022
Closest in time.
Anthony Leverrier and Gilles Zémor. ”Quantum Tanner codes.” arXiv preprint arXiv:2202.13641 (2022)
2022
Closest in time.
Pavel Panteleev and Gleb Kalachev. ”Asymptotically good quantum and locally testable classical LDPC codes”. Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 375-388, 2022
2022
Closest in time.