Given two binary linear codes R and C, their tensor product RC consists of all matrices with rows in R and columns in C. We analyze the “robustness” of the following test for this code (suggested by Ben-Sasson and Sudan [6]): Pick a random row (or column) and check if the received word is in R (or C). Robustness of the test implies that if a matrix M is far from RC, then a significant fraction of the rows (or columns) of M are far from codewords of R (or C).

We show that this test is robust, provided one of the codes is what we refer to as smooth. We show that expander codes and locally-testable codes are smooth. This complements recent examples of P. Valiant [13] and Coppersmith and Rudra [9] of codes whose tensor product is not robustly testable.


Tensor Product Linear Code Parity Check Local View Testable 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.
    Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of the ACM 45(3), 501–555 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM 45(1), 70–122 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Ben-Sasson, E., Goldreich, O., Harsha, P., Sudan, M., Vadhan, S.: Robust PCPs of proximity, shorter PCPs and applications to coding. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (to appear, 2004)Google Scholar
  4. 4.
    Ben-Sasson, E., Goldriech, O., Harsha, P., Sudan, M., Vadhan, S.: Short PCPs verifiable in polylogarithmic time. In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, June 12–15, pp. 120–134 (2005)Google Scholar
  5. 5.
    Ben-Sasson, E., Harsha, P., Raskhodnikova, S.: Some 3CNF properties are hard to test. SIAM Journal on Computing 35(1), 1—21Google Scholar
  6. 6.
    Ben-Sasson, E., Sudan, M.: Robust locally testable codes and products of codes. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 286–297. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  7. 7.
    Ben-Sasson, E., Sudan, M.: Short PCPs with poly-log rate and query complexity. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 266–275 (2005)Google Scholar
  8. 8.
    Ben-Sasson, E., Sudan, M., Vadhan, S., Wigderson, A.: Randomness efficient low-degree tests and short PCPs via ε-biased sets. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pp. 612–621 (2003)Google Scholar
  9. 9.
    Coppersmith, D., Rudra, A.: On the robust testability of product of codes. ECCC TR05-104 (2005)Google Scholar
  10. 10.
    Dinur, I.: The PCP theorem by gap amplification. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 241–250 (2006)Google Scholar
  11. 11.
    Feige, U., Goldwasser, S., Lovasz, L., Safra, S., Szegedy, M.: Interactive proofs and the hardness of approximating cliques. Journal of the ACM 43(2), 268–292 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Goldreich, O., Sudan, M.: Locally testable codes and PCPs of almost-linear length. In: Proc. 43rd IEEE Symp. on Foundations of Computer Science, pp. 13–22 (2002)Google Scholar
  13. 13.
    Valiant, P.: The tensor product of two codes is not necessarily robustly testable. In: APPROX-RANDOM, pp. 472–481 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Irit Dinur
    • 1
  • Madhu Sudan
    • 2
  • Avi Wigderson
    • 3
  1. 1.Hebrew UniversityJerusalemIsrael
  2. 2.Massachusetts Institute of TechnologyCambridge
  3. 3.Institute for Advanced StudyPrinceton

Personalised recommendations