Skip to main content
Springer Nature Link
Log in

The Tensor Product of Two Codes Is Not Necessarily Robustly Testable

  • Conference paper
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (APPROX 2005, RANDOM 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3624))

Abstract

There has been significant interest lately in the task of constructing codes that are testable with a small number of random probes. Ben-Sasson and Sudan show that the repeated tensor product of codes leads to a general class of locally testable codes. One question that is not settled by their work is the local testability of a code generated by a single application of the tensor product. Special cases of this question have been studied in the literature in the form of “tests for bivariate polynomials”, where the tensor product has been shown to be locally testable for certain families of codes. However the question remained open for the tensor product of generic families of codes. Here we resolve the question negatively, giving families of codes whose tensor product does not have good local testability properties.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Arora, S.: Probabilistic checking of proofs and the hardness of approximation problems. PhD thesis, University of California at Berkeley (1994)

    Google Scholar 

  2. 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)

    Article  MATH  MathSciNet  Google Scholar 

  3. Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM 45(1), 70–122 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  4. 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, pp. 1–10 (2004)

    Google Scholar 

  5. 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)

    Chapter  Google Scholar 

  6. Ben-Sasson, E., Sudan, M.: Simple PCPs with Poly-log Rate and Query Complexity. In: 37th STOC (2005) (to appear)

    Google Scholar 

  7. Friedl, K., Sudan, M.: Some improvements to total degree tests. In: Proceedings of the 3rd Annual Israel Symposium on Theory of Computing and Systems, Tel Aviv, Israel, January 4-6, pp. 190–198 (1995), available online at http://theory.csail.mit.edu/~madhu/papers/friedl.ps

  8. Goldreich, O., Sudan, M.: Locally testable codes and PCPs of almostlinear length. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, Canada, November 16-19 (2002)

    Google Scholar 

  9. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. Elsevier/North-Holland (1981)

    Google Scholar 

  10. Polishchuk, A., Spielman, D.A.: Nearly linear-size holographic proofs. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, Montreal, Quebec, Canada, May 23-25, pp. 194–203 (1994)

    Google Scholar 

  11. Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing 25(2), 252–271 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  12. Raz, R., Safra, S.: A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP. In: Proceedings of the 29th STOC, pp. 475–484 (1997)

    Google Scholar 

  13. Sudan, M.: Algorithmic introduction to coding theory. Lecture notes (2001), available from http://theory.csail.mit.edu/~madhu/FT01/

Download references

Author information

Authors and Affiliations

  1. Massachusetts Institute of Technology,  

    Paul Valiant

Authors
  1. Paul Valiant
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, University of Illinois, 61801, Urbana, IL

    Chandra Chekuri

  2. Institute for Computer Science, University of Kiel, Olshausenstrasse 40, 24118, Kiel, Germany

    Klaus Jansen

  3. Battelle Bâtiment A, Centre Universitaire d’Informatique, Route de Drize 7, 1227, Carouge, Geneva, Switzerland

    José D. P. Rolim

  4. UC Berkeley,  

    Luca Trevisan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Valiant, P. (2005). The Tensor Product of Two Codes Is Not Necessarily Robustly Testable. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds) Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2005 2005. Lecture Notes in Computer Science, vol 3624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11538462_40

Download citation

  • DOI: https://doi.org/10.1007/11538462_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28239-6

  • Online ISBN: 978-3-540-31874-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics