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. In particular we show that there exists codes satisfying the requirements of Barak et al. (FOCS 2012) to construct small set expanders with a large number of eigenvalues close to the maximal one, with rate slightly higher than the ones used in their work.


IEEE Computer Society Linear Code Block Length LDPC Code Base Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alon, N., Kaufman, T., Krivelevich, M., Litsyn, S., Ron, D.: Testing Reed-Muller codes. IEEE Transactions on Information Theory 51(11), 4032–4039 (2005)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Arora, S., Sudan, M.: Improved low degree testing and its applications. Combinatorica 23(3), 365–426 (2003)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Barak, B., Gopalan, P., Håstad, J., Meka, R., Raghavendra, P., Steurer, D.: Making the long code shorter, with applications to the unique games conjecture. In: FOCS. IEEE Computer Society (2012)Google Scholar
  4. 4.
    Ben-Sasson, E., Grigorescu, E., Maatouk, G., Shpilka, A., Sudan, M.: On sums of locally testable affine invariant properties. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) APPROX/RANDOM 2011. LNCS, vol. 6845, pp. 400–411. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  5. 5.
    Ben-Sasson, E., Maatouk, G., Shpilka, A., Sudan, M.: Symmetric LDPC codes are not necessarily locally testable. In: IEEE Conference on Computational Complexity, pp. 55–65. IEEE Computer Society (2011)Google Scholar
  6. 6.
    Ben-Sasson, E., Sudan, M.: Limits on the rate of locally testable affine-invariant codes. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) APPROX/RANDOM 2011. LNCS, vol. 6845, pp. 412–423. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  7. 7.
    Bhattacharyya, A., Kopparty, S., Schoenebeck, G., Sudan, M., Zuckerman, D.: Optimal testing of reed-muller codes. In: FOCS, pp. 488–497. IEEE Computer Society (2010)Google Scholar
  8. 8.
    Blum, M., Luby, M., Rubinfeld, R.: Self-testing/correcting with applications to numerical problems. In: STOC, pp. 73–83. ACM (1990)Google Scholar
  9. 9.
    Grigorescu, E., Kaufman, T., Sudan, M.: 2-transitivity is insufficient for local testability. In: IEEE Conference on Computational Complexity, pp. 259–267. IEEE Computer Society (2008)Google Scholar
  10. 10.
    Grigorescu, E., Kaufman, T., Sudan, M.: Succinct representation of codes with applications to testing. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX and RANDOM 2009. LNCS, vol. 5687, pp. 534–547. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  11. 11.
    Guo, A., Kopparty, S., Sudan, M.: New affine-invariant codes from lifting. In: Proceedings of ITCS 2013 (to appear, 2013)Google Scholar
  12. 12.
    Haramaty, E., Ron-Zewi, N., Sudan, M.: Absolutely sound testing of lifted codes. Electronic Colloquium on Computational Complexity (ECCC) 20, 30 (2013)Google Scholar
  13. 13.
    Haramaty, E., Shpilka, A., Sudan, M.: Optimal testing of multivariate polynomials over small prime fields. In: FOCS, pp. 629–637. IEEE Computer Society (2011)Google Scholar
  14. 14.
    Jutla, C.S., Patthak, A.C., Rudra, A., Zuckerman, D.: Testing low-degree polynomials over prime fields. Random Struct. Algorithms 35(2), 163–193 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Kaufman, T., Ron, D.: Testing polynomials over general fields. SIAM Journal of Computing 36(3), 779–802 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  16. 16.
    Kaufman, T., Sudan, M.: Algebraic property testing: The role of invariance. Electronic Colloquium on Computational Complexity (ECCC) 14(111) (2007)Google Scholar
  17. 17.
    Kaufman, T., Sudan, M.: Algebraic property testing: the role of invariance. In: STOC, pp. 403–412. ACM (2008)Google Scholar
  18. 18.
    Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability pcp characterization of np. In: STOC, pp. 475–484. ACM (1997)Google Scholar
  19. 19.
    Ron-Zewi, N., Sudan, M.: A new upper bound on the query complexity for testing generalized reed-muller codes. In: Gupta, A., Jansen, K., Rolim, J., Servedio, R. (eds.) APPROX/RANDOM 2012. LNCS, vol. 7408, pp. 639–650. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  20. 20.
    Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM J. on Computing 25(2), 252–271 (1996)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Department of Computer ScienceTechnionHaifaIsrael
  2. 2.Microsoft Research New EnglandCambridgeUSA

Personalised recommendations