Absolutely Sound Testing of Lifted Codes

In this work we present a strong analysis of the testability of a broad, and to date the most interesting known, class of “affine-invariant” codes. Affine-invariant codes are codes whose coordinates are associated with a vector space and are invariant under affine transformations of the coordinate space. Affine-invariant linear codes form a natural abstraction of algebraic properties such as linearity and low-degree, which have been of significant interest in theoretical computer science in the past. The study of affine-invariance is motivated in part by its relationship to property testing: Affine-invariant linear codes tend to be locally testable under fairly minimal and almost necessary conditions. Recent works by Ben-Sasson et al. (CCC 2011) and Guo et al. (ITCS 2013) have introduced a new class of affine-invariant linear codes based on an operation called “lifting”. Given a base code over a t-dimensional space, its m-dimensional lift consists of all words whose restriction to every t-dimensional affine subspace is a codeword of the base code. Lifting not only captures the most familiar codes, which can be expressed as lifts of low-degree polynomials, it also yields new codes when lifting “medium-degree” polynomials whose rate is better than that of corresponding polynomial codes, and all other combinatorial qualities are no worse. In this work we show that codes derived from lifting are also testable in an “absolutely sound” way. Specifically, we consider the natural test: Pick a random affine subspace of base dimension and verify that a given word is a codeword of the base code when restricted to the chosen subspace. We show that this test accepts codewords with probability one, while rejecting words at constant distance from the code with constant probability (depending only on the alphabet size). This work thus extends the results of Bhattacharyya et al. (FOCS 2010) and Haramaty et al. (FOCS 2011), while giving concrete new codes of higher rate that have absolutely sound testers.

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

[2]  Eli Ben-Sasson,et al.  Limits on the Rate of Locally Testable Affine-Invariant Codes , 2011, APPROX-RANDOM.

[3]  H. Furstenberg,et al.  A density version of the Hales-Jewett theorem , 1991 .

[4]  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.

[5]  Shachar Lovett,et al.  Every locally characterized affine-invariant property is testable , 2013, STOC '13.

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

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

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

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

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

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

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

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

[14]  Dana Ron,et al.  Testing polynomials over general fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

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

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

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

[18]  D. Polymath,et al.  A new proof of the density Hales-Jewett theorem , 2009, 0910.3926.

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

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

[21]  Madhu Sudan,et al.  A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes , 2012, APPROX-RANDOM.