Robust Testing of Lifted Codes with Applications to Low-Degree Testing

A local tester for a code probabilistically views a small set of coordinates of a given word and based on this local view accepts code words with probability one while rejecting words far from the code with constant probability. A local tester for a code is said to be "robust" if the local views of the tester are far from acceptable views when the word being tested is far from the code. Robust testability of codes play a fundamental role in constructions of probabilistically checkable proofs where robustness is a critical element in composition. In this work we consider a broad class of codes, called lifted codes, that include codes formed by low-degree polynomials, and show that an almost natural test, extending a low-degree test proposed by Raz and Safra (STOC 1997), is robust. Our result is clean and general -- the robustness of the test depends only on the distance of the code being lifted, and is positive whenever the distance is positive. We use our result to get the first robust low-degree test that works when the degree of the polynomial being tested is more than half the field size. Our results also show that the high-rate codes of Guo et al. (ITCS 2013) are robustly locally testable with sub linear query complexity. Guo et al. Also show several other interesting classes of locally testable codes that can be derived from lifting and our result shows all such codes have robust testers, at the cost of a quadratic blow up in the query complexity of the tester. Of technical interest is an intriguing relationship between tensor product codes and lifted codes that we explore and exploit.

[1]  Michael Viderman,et al.  A combination of testability and decodability by tensor products , 2011, Random Struct. Algorithms.

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

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

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

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

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

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

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

[9]  Shachar Lovett,et al.  Testing of exponentially large codes, by a new extension to Weil bound for character sums , 2010, Electron. Colloquium Comput. Complex..

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

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

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

[13]  Madhu Sudan,et al.  Improved Low-Degree Testing and its Applications , 1997, STOC '97.

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

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

[16]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

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

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

[19]  Eli Ben-Sasson,et al.  A new family of locally correctable codes based on degree-lifted algebraic geometry codes , 2013, STOC '13.

[20]  Elchanan Mossel,et al.  Rapid mixing of Gibbs sampling on graphs that are sparse on average , 2009 .

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

[22]  Prasad Raghavendra,et al.  List decoding tensor products and interleaved codes , 2008, STOC '09.

[23]  Madhu Sudan,et al.  Optimal Testing of Multivariate Polynomials over Small Prime Fields , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[24]  Alan Guo,et al.  New affine-invariant codes from lifting , 2012, ITCS '13.

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

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

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

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

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

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

[31]  Ran Raz,et al.  Sub-Constant Error Low Degree Test of Almost-Linear Size , 2008, SIAM J. Comput..

[32]  Klaus Jansen,et al.  Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings , 2008, APPROX-RANDOM.

[33]  Atri Rudra,et al.  Testing low-degree polynomials over prime fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.