The tensor product of two good codes is not necessarily robustly testable

DOI10.1016/j.ipl.2012.01.007zbMath1243.94046OpenAlexW2030221686MaRDI QIDQ436324

Or Meir, Oded Goldreich

Publication date: 20 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.01.007

zbMATH Keywords

robustrobustnesstensor productlocally testable codesproduct code

Mathematics Subject Classification ID

Other types of codes (94B60) Combinatorial codes (94B25)

Related Items (9)

Unnamed Item ⋮ Unnamed Item ⋮ Local List Recovery of High-Rate Tensor Codes and Applications ⋮ Unnamed Item ⋮ On the rectangle method in proofs of robustness of tensor products ⋮ Tensor Products of Weakly Smooth Codes Are Robust ⋮ Composition of semi-LTCs by two-wise tensor products ⋮ Unnamed Item ⋮ A combination of testability and decodability by tensor products

Cites Work

• Unnamed Item
• Unnamed Item
• On the rectangle method in proofs of robustness of tensor products
• Nearly-linear size holographic proofs
• Short Locally Testable Codes and Proofs
• A Combination of Testability and Decodability by Tensor Products
• Locally testable codes and PCPs of almost-linear length
• Combinatorial Construction of Locally Testable Codes
• Robust Local Testability of Tensor Products of LDPC Codes
• Short PCPs with Polylog Query Complexity
• Composition of Semi-LTCs by Two-Wise Tensor Products
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Robust locally testable codes and products of codes
• Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
• Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
• The PCP theorem by gap amplification

This page was built for publication: The tensor product of two good codes is not necessarily robustly testable