Combinatorial construction of locally testable codes

An error correcting code is said to be locally testable if there is a test that checks whether a given string is a codeword, or rather far from the code, by reading only a constant number of symbols of the string. Locally Testable Codes (LTCs) were first systematically studied by Goldreich and Sudan (J. ACM 53(4)) and since then several Constructions of LTCs have been suggested. While the best known construction of LTCs by Ben-Sasson and Sudan (STOC 2005) and Dinur (J. ACM 54(3)) achieves very efficient parameters, it relies heavily on algebraic tools and on PCP machinery. In this work we present a new and arguably simpler construction of LTCs that is purely combinatorial, does not rely on PCP machinery and matches the parameters of the best known construction. However, unlike the latter construction, our construction is not entirely explicit.

[1]  Yehuda Lindell.  Introduction to Coding Theory Lecture Notes , 2009 .

[2]  Omer Reingold,et al.  Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem , 2004, FOCS.

[3]  Eli Ben-Sasson,et al.  Simple PCPs with poly-log rate and query complexity , 2005, STOC '05.

[4]  Eli Ben-Sasson,et al.  Robust pcps of proximity, shorter pcps and applications to coding , 2004, STOC '04.

[5]  Oded Goldreich,et al.  Locally testable codes and PCPs of almost-linear length , 2006, JACM.

[6]  Daniel A. Spielman,et al.  Nearly-linear size holographic proofs , 1994, STOC '94.

[7]  Sanjeev Arora.  Probabilistic checking of proofs and hardness of approximation problems , 1995 .

[8]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[9]  Robust locally testable codes and products of codes , 2006 .

[10]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[11]  Avi Wigderson,et al.  Robust local testability of tensor products of LDPC codes ? , 2006 .

[12]  Noga Alon,et al.  Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.

[13]  Madhu Sudan,et al.  Sparse Random Linear Codes are Locally Decodable and Testable , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[14]  Carsten Lund,et al.  Proof verification and the intractability of approximation problems , 1992, FOCS 1992.

[15]  Atri Rudra,et al.  On the Robust Testability of Product of Codes , 2005, Electron. Colloquium Comput. Complex..

[16]  Eli Ben-Sasson,et al.  Sound 3-Query PCPPs Are Long , 2008, TOCT.

[17]  Or Meir.  Combinatorial Construction of Locally Testable Codes , 2009, SIAM J. Comput..

[18]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[19]  Paul Valiant,et al.  The Tensor Product of Two Codes Is Not Necessarily Robustly Testable , 2005, APPROX-RANDOM.

[20]  L. Fortnow,et al.  On the power of multi-power interactive protocols , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[21]  Madhu Sudan,et al.  Some improvements to total degree tests , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[22]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[23]  Oded Goldreich,et al.  Short Locally Testable Codes and Proofs (Survey) , 2005, Electron. Colloquium Comput. Complex..

[24]  Avi Wigderson,et al.  Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[25]  Irit Dinur,et al.  The PCP theorem by gap amplification , 2006, STOC.