Limits on the Rate of Locally Testable Affine-Invariant Codes

Despite its many applications, to program checking, probabilistically checkable proofs, locally testable and locally decodable codes, and cryptography, "algebraic property testing" is not well-understood. A significant obstacle to a better understanding, was a lack of a concrete definition that abstracted known testable algebraic properties and reflected their testability. This obstacle was removed by [Kaufman and Sudan, STOC 2008] who considered (linear) "affine-invariant properties", i.e., properties that are closed under summation, and under affine transformations of the domain. Kaufman and Sudan showed that these two features (linearity of the property and its affine-invariance) play a central role in the testability of many known algebraic properties. However their work does not give a complete characterization of the testability of affine-invariant properties, and several technical obstacles need to be overcome to obtain such a characterization. Indeed, their work left open the tantalizing possibility that locally testable codes of rate dramatically better than that of the family of Reed-Muller codes (the most popular form of locally testable codes, which also happen to be affine-invariant) could be found by systematically exploring the space of affine-invariant properties. In this work we rule out this possibility and show that general (linear) affine-invariant properties are contained in Reed-Muller codes that are testable with a slightly larger query complexity. A central impediment to proving such results was the limited understanding of the structural restrictions on affine-invariant properties imposed by the existence of local tests. We manage to overcome this limitation and present a clean restriction satisfied by affine-invariant properties that exhibit local tests. We do so by relating the problem to that of studying the set of solutions of a certain nice class of (uniform, homogenous, diagonal) systems of multivariate polynomial equations. Our main technical result completely characterizes (combinatorially) the set of zeroes, or algebraic set, of such systems.

[1]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

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

[3]  Eli Ben-Sasson,et al.  Some 3CNF properties are hard to test , 2003, STOC '03.

[4]  Eyal Kushilevitz,et al.  Private information retrieval , 1998, JACM.

[5]  Jonathan Katz,et al.  On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.

[6]  Alex Samorodnitsky,et al.  Low-degree tests at large distances , 2006, STOC '07.

[7]  Noga Alon,et al.  A combinatorial characterization of the testable graph properties: it's all about regularity , 2006, STOC '06.

[8]  David P. Woodruff.  New Lower Bounds for General Locally Decodable Codes , 2007, Electron. Colloquium Comput. Complex..

[9]  Sergey Yekhanin,et al.  Towards 3-query locally decodable codes of subexponential length , 2008, JACM.

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

[11]  Luca Trevisan,et al.  Lower bounds for linear locally decodable codes and private information retrieval , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[12]  Sergey Yekhanin.  Locally Decodable Codes , 2012, Found. Trends Theor. Comput. Sci..

[13]  Madhu Sudan,et al.  2-Transitivity Is Insufficient for Local Testability , 2008, Computational Complexity Conference.

[14]  Madhu Sudan,et al.  Optimal Testing of Reed-Muller Codes , 2010, FOCS.

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

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

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

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

[19]  Dana Ron,et al.  Testing Polynomials over General Fields , 2006, SIAM J. Comput..

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

[21]  Testing low-degree polynomials over prime fields , 2009 .

[22]  Shu Lin,et al.  Some Results on Cyclic Codes which Are Invariant under the Affine Group and Their Application , 1966, Inf. Control..

[23]  Madhu Sudan,et al.  Optimal Testing of Reed-Muller Codes , 2009, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[24]  Noga Alon,et al.  Testing Reed-Muller codes , 2005, IEEE Transactions on Information Theory.

[25]  Martin Grohe.  The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2007, JACM.

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

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

[28]  Madhu Sudan,et al.  Succinct Representation of Codes with Applications to Testing , 2012, SIAM J. Discret. Math..

[29]  Klim Efremenko,et al.  3-Query Locally Decodable Codes of Subexponential Length , 2008 .

[30]  Madhu Sudan,et al.  Efficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems , 1995, Lecture Notes in Computer Science.

[31]  Leonid A. Levin,et al.  Checking computations in polylogarithmic time , 1991, STOC '91.

[32]  E. Ben-Sasson,et al.  CNF Properties are Hard to Test , 2002 .

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

[34]  László Lovász,et al.  Graph limits and parameter testing , 2006, STOC '06.

[35]  Sanjeev Arora,et al.  Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.