Skip to main content
SpringerLink
Log in

Composition of semi-LTCs by two-wise tensor products

  • Published:
computational complexity Aims and scope Submit manuscript

Abstract

In this paper, we obtain a composition theorem that allows us to construct locally testable codes (LTCs) by repeated two-wise tensor products. This is the first composition theorem showing that repeating the two-wise tensor operation any constant number of times still results in a locally testable code, improving upon previous results which only worked when the tensor product was applied once.

To obtain our results, we define a new tester for tensor products. Our tester uses the distribution of the “inner tester” associated with the base code to sample rows and columns of the product code. This construction differs from previously studied testers for tensor product codes which sampled rows and columns uniformly.

We show that if the base code is any LTC or any expander code, then the code obtained by taking the repeated two-wise tensor product of the base code with itself is locally testable. In particular, this answers a question posed in the paper of Dinur et al. (2006) by expanding the class of allowed base codes to include all LTCs and not just so-called uniform LTCs whose associated tester queries all codeword entries with equal probability.

One corollary of our composition theorem is a simple construction of high-rate LTCs with sublinear query complexity. More formally, we show that for every ε, ρ > 0 there exists a family of LTCs over the binary field with query complexity n ε and rate at least 1 − ρ.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Arora Sanjeev, Lund Carsten, Motwani Rajeev, Sudan Madhu, Szegedy Mario (1998) Proof Verification and the Hardness of Approximation Problems. Journal of the ACM 45(3): 501–555

    Article  MATH  MathSciNet  Google Scholar 

  • Ben-Sasson Eli, Goldreich Oded, Harsha Prahladh, Sudan Madhu, Vadhan Salil P. (2006) Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. SIAM Journal on Computing 36(4): 889–974

    Article  MATH  MathSciNet  Google Scholar 

  • Eli Ben-Sasson, Prahladh Harsha & Sofya Raskhodnikova (2005). Some 3CNF Properties Are Hard to Test. SIAM Journal on Computing 35(1), 1–21. URL http://epubs.siam.org/SICOMP/volume-35/art_44544.html.

    Google Scholar 

  • Eli Ben-Sasson & Madhu Sudan (2006). Robust locally testable codes and products of codes. Random Struct. Algorithms 28(4), 387–402. URL http://dx.doi.org/10.1002/rsa.20120.

  • Eli Ben-Sasson & Madhu Sudan (2008). Short PCPs with Polylog Query Complexity. SIAM J. Comput 38(2), 551–607. URL http://dx.doi.org/10.1137/050646445.

  • Eli Ben-Sasson & Michael Viderman (2009a). Composition of Semi-LTCs by Two-Wise Tensor Products. In APPROX-RANDOM, Irit Dinur, Klaus Jansen, Joseph Naor & José D. P. Rolim, editors, volume 5687 of Lecture Notes in Computer Science, 378–391. Springer. ISBN 978-3-642-03684-2. URL http://dx.doi.org/10.1007/978-3-642-03685-9.

  • Eli Ben-Sasson & Michael Viderman (2009b). Tensor Products of Weakly Smooth Codes are Robust. Theory of Computing 5(1), 239–255. URL http://dx.doi.org/10.4086/toc.2009.v005a012.

  • Eli Ben-Sasson & Michael Viderman (2010). Low Rate Is Insufficient for Local Testability. In APPROX-RANDOM, Maria J. Serna, Ronen Shaltiel, Klaus Jansen & José D. P. Rolim, editors, volume 6302 of Lecture Notes in Computer Science, 420–433. Springer. ISBN 978-3-642-15368-6. URL http://dx.doi.org/10.1007/978-3-642-15369-3.

  • Amir Bennatan, David Burshtein (2004) On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels. IEEE Transactions on Information Theory 50(3): 417–438

    Article  MATH  Google Scholar 

  • M. Blum M. Luby & R. Rubinfeld (1993). Self-Testing/Correcting with Applications to Numerical Problems. JCSS: Journal of Computer and System Sciences 47.

  • Don Coppersmith & Atri Rudra (2005). On the Robust Testability of Product of Codes. Electronic Colloquium on Computational Complexity (ECCC) (104). URL http://eccc.hpi-web.de/eccc-reports/2005/TR05-104/index.html.

  • Irit Dinur (2007). The PCP theorem by gap amplification. Journal of the ACM 54(3), 12:1–12:44. ISSN 0004-5411.

    Google Scholar 

  • Irit Dinur & Omer Reingold (2006). Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem. SIAM Journal on Computing 36(4), 975–1024. URL http://dx.doi.org/10.1137/S0097539705446962.

    Google Scholar 

  • Irit Dinur, Madhu Sudan & Avi Wigderson (2006). Robust Local Testability of Tensor Products of LDPC Codes. In APPROX-RANDOM, volume 4110 of Lecture Notes in Computer Science, 304–315. Springer. ISBN 3-540-38044-2. URL http://dx.doi.org/10.1007/11830924_29.

  • R. G. Gallager (1963). Low-density Parity Check Codes. MIT Press.

  • Gallager R.G. (1968) Information Theory and Reliable Communication. Wiley, New York

    MATH  Google Scholar 

  • Oded Goldreich (2005). Short Locally Testable Codes and Proofs (Survey). Electronic Colloquium on Computational Complexity (ECCC) (014). URL http://eccc.hpi-web.de/eccc-reports/2005/TR05-014/index.html.

  • Oded Goldreich & Or Meir (2007). The Tensor Product of Two Good Codes Is Not Necessarily Robustly Testable. Electronic Colloquium on Computational Complexity (ECCC) 14(062). URL http://eccc.hpi-web.de/eccc-reports/2007/TR07-062/index.html.

  • Oded Goldreich & Madhu Sudan (2006). Locally testable codes and PCPs of almost-linear length. Journal of the ACM 53(4), 558–655. ISSN 0004-5411.

    Google Scholar 

  • Tali Kaufman & Madhu Sudan (2007). Sparse Random Linear Codes are Locally Decodable and Testable. In FOCS, 590–600. IEEE Computer Society. URL http://doi.ieeecomputersociety.org/10.1109/FOCS.2007.65.

  • Tali Kaufman & Madhu Sudan (2008). Algebraic property testing: the role of invariance. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, 403–412. ACM. ISBN 978-1-60558-047-0. URL http://doi.acm.org/10.1145/1374376.1374434.

  • Tali Kaufman & Michael Viderman (2010). Locally Testable vs. Locally Decodable Codes. In APPROX-RANDOM, Maria J. Serna, Ronen Shaltiel, Klaus Jansen & José D. P. Rolim, editors, volume 6302 of Lecture Notes in Computer Science, 670–682. Springer. ISBN 978-3-642-15368-6. URL http://dx.doi.org/10.1007/978-3-642-15369-3.

  • Swastik Kopparty & Shubhangi Saraf (2010). Local list-decoding and testing of random linear codes from high error. In Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, Leonard J. Schulman, editor, 417–426. ACM. ISBN 978-1-4503-0050-6. URL http://doi.acm.org/10.1145/1806689.1806748.

  • Swastik Kopparty, Shubhangi Saraf & Sergey Yekhanin (2010). High-rate codes with sublinear-time decoding. In ECCC - TR10-148. URL http://eccc.hpi-web.de/report/2010/148/.

  • Grigoriĭ A. Margulis (1982). Explicit constructions of graphs without short cycles and low density codes. Combinatorica 2(1), 71–78.

  • Or Meir (2009). Combinatorial Construction of Locally Testable Codes. SIAM J. Comput 39(2), 491–544. URL http://dx.doi.org/10.1137/080729967.

  • Michael Sipser & Daniel A. Spielman (1996). Expander Codes. IEEE Transactions on Information Theory 42(6), 1710–1722. Preliminary version appeared in FOCS 1994.

  • Luca Trevisan (2004). Some Applications of Coding Theory in Computational Complexity. In ECCC: Electronic Colloquium on Computational Complexity, technical reports.

  • Paul Valiant (2005). The Tensor Product of Two Codes Is Not Necessarily Robustly Testable. In APPROX-RANDOM, volume 3624 of Lecture Notes in Computer Science, 472–481. Springer. ISBN 3-540-28239-4. URL http://dx.doi.org/10.1007/11538462_40.

  • Michael Viderman (2012).A Combination of Testability and Decodability by Tensor Products. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings, Anupam Gupta, Klaus Jansen, José D. P. Rolim & Rocco A. Servedio, editors, volume 7408 of Lecture Notes in Computer Science, 651–662. Springer. ISBN 978-3-642-32511-3. URL http://dx.doi.org/10.1007/978-3-642-32512-0.

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Technion—Israel Institute of Technology, Haifa, 32000, Israel

    Eli Ben-Sasson & Michael Viderman

Authors
  1. Eli Ben-Sasson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Viderman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michael Viderman.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ben-Sasson, E., Viderman, M. Composition of semi-LTCs by two-wise tensor products. comput. complex. 24, 601–643 (2015). https://doi.org/10.1007/s00037-013-0074-8

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00037-013-0074-8

Keywords

Subject classification

Search

Navigation