A combinatorial characterization of smooth LTCs and applications

The study of locally testable codes (LTCs) has benefited from a number of nontrivial constructions discovered in recent years. Yet, we still lack a good understanding of what makes a linear error correcting code locally testable and as a result we do not know what is the rate-limit of LTCs and whether asymptotically good linear LTCs with constant query complexity exist. In this paper, we provide a combinatorial characterization of smooth locally testable codes, which are locally testable codes whose associated tester queries every bit of the tested word with equal probability. Our main contribution is a combinatorial property defined on the Tanner graph associated with the code tester (“well-structured tester”). We show that a family of codes is smoothly locally testable if and only if it has a well-structured tester. As a case study we show that the standard tester for the Hadamard code is “well-structured,” giving an alternative proof of the local testability of the Hadamard code, originally proved by (Blum, Luby, Rubinfeld, J. Comput. Syst. Sci. 47 (1993) 549–595) (STOC 1990). Additional connections to the works of (Ben-Sasson, Harsha, Raskhodnikova, SIAM J. Comput 35 (2005) 1–21) (SICOMP 2005) and of (Lachish, Newman and Shapira, Comput Complex 17 (2008) 70–93) are also discussed. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 2016

[1]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[2]  Shachar Lovett,et al.  New Extension of the Weil Bound for Character Sums with Applications to Coding , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[3]  Eli Ben-Sasson,et al.  Sparse affine-invariant linear codes are locally testable , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[4]  Eli Ben-Sasson,et al.  Composition of semi-LTCs by two-wise tensor products , 2009, computational complexity.

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

[6]  Venkatesan Guruswami,et al.  Locally Testable Codes Require Redundant Testers , 2009, Computational Complexity Conference.

[7]  Asaf Shapira,et al.  Space Complexity vs. Query Complexity , 2006, APPROX-RANDOM.

[8]  Jeffrey D. Ullman,et al.  Some Results on Tape-Bounded Turing Machines , 1969, JACM.

[9]  Eli Ben-Sasson,et al.  Low Rate Is Insufficient for Local Testability , 2010, APPROX-RANDOM.

[10]  Eli Ben-Sasson,et al.  Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding , 2004, SIAM J. Comput..

[11]  Simon Litsyn,et al.  Breaking the Epsilon-Soundness Bound of the Linearity Test over GF(2) , 2008, SIAM J. Comput..

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

[13]  Eli Ben-Sasson,et al.  On Sums of Locally Testable Affine Invariant Properties , 2011, APPROX-RANDOM.

[14]  Frederick N. Springsteel,et al.  Language Recognition by Marking Automata , 1972, Inf. Control..

[15]  Eli Ben-Sasson,et al.  Symmetric LDPC Codes are not Necessarily Locally Testable , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

[16]  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).

[17]  Nancy A. Lynch,et al.  Log Space Recognition and Translation of Parenthesis Languages , 1977, JACM.

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

[19]  Kurt Mehlhorn,et al.  A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition , 1992, Inf. Process. Lett..

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

[21]  Helmut Alt,et al.  Lower bounds on space complexity for contextfree recognition , 1979, Acta Informatica.

[22]  Oded Goldreich,et al.  Locally testable codes and PCPs of almost-linear length , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[23]  Omer Reingold,et al.  Assignment testers: towards a combinatorial proof of the PCP-theorem , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

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

[25]  C. SIAMJ..  TESTING MEMBERSHIP IN LANGUAGES THAT HAVE SMALL WIDTH BRANCHING PROGRAMS , 2002 .

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

[27]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[28]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[29]  Eli Ben-Sasson,et al.  Some 3CNF Properties Are Hard to Test , 2005, SIAM J. Comput..

[30]  Richard Edwin Stearns,et al.  Memory bounds for recognition of context-free and context-sensitive languages , 1965, SWCT.

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

[32]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[33]  D. Spielman,et al.  Computationally efficient error-correcting codes and holographic proofs , 1995 .

[34]  Eli Ben-Sasson,et al.  Tensor Products of Weakly Smooth Codes are Robust , 2008, Theory Comput..

[35]  Shubhangi Saraf,et al.  Tolerant Linearity Testing and Locally Testable Codes , 2009, APPROX-RANDOM.

[36]  Madhu Sudan,et al.  Algebraic property testing: the role of invariance , 2008, Electron. Colloquium Comput. Complex..

[37]  Eli Ben-Sasson,et al.  Limitation on the Rate of Families of Locally Testable Codes , 2010, Property Testing.

[38]  Kurt Mehlhorn,et al.  Bracket-Languages are Recognizable in Logarithmic Space , 1976, Inf. Process. Lett..

[39]  Noga Alon,et al.  Regular languages are testable with a constant number of queries , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

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

[41]  Prasad Raghavendra,et al.  Making the long code shorter, with applications to the Unique Games Conjecture , 2011, Electron. Colloquium Comput. Complex..

[42]  Mihir Bellare,et al.  Linearity testing in characteristic two , 1996, IEEE Trans. Inf. Theory.

[43]  Manuel Blum,et al.  Self-Testing/Correcting with Applications to Numerical Problems , 1993, J. Comput. Syst. Sci..