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

DOI10.1016/J.IPL.2012.01.007MaRDI QIDQ436324zbMATH OpenOpenAlexFDO

Authors Oded Goldreich, Or Meir

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

robusttensor productrobustnesslocally testable codesproduct code

Mathematics Subject Classification ID

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

Recommendations

• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Robust Local Testability of Tensor Products of LDPC Codes
• On the rectangle method in proofs of robustness of tensor products
• Tensor Products of Weakly Smooth Codes Are Robust
• Tensor products of weakly smooth codes are robust

Cites work

• scientific article; zbMATH DE number 3133919 (Why is no real title available?)
• A combination of testability and decodability by tensor products
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
• Combinatorial construction of locally testable codes
• Composition of Semi-LTCs by Two-Wise Tensor Products
• Locally testable codes and PCPs of almost-linear length
• Nearly-linear size holographic proofs
• On the rectangle method in proofs of robustness of tensor products
• Robust Local Testability of Tensor Products of LDPC Codes
• Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
• Robust locally testable codes and products of codes
• Short PCPs with Polylog Query Complexity
• Short locally testable codes and proofs
• Tensor products of weakly smooth codes are robust
• The PCP theorem by gap amplification

Cited in

(12)

• Tensor Products of Weakly Smooth Codes Are Robust
• Composition of semi-LTCs by two-wise tensor products
• Robust Local Testability of Tensor Products of LDPC Codes
• On axis-parallel tests for tensor product codes
• On the rectangle method in proofs of robustness of tensor products
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Local list recovery of high-rate tensor codes and applications
• A combination of testability and decodability by tensor products
• Explicit strong LTCs with inverse poly-log rate and constant soundness
• On axis-parallel tests for tensor product codes
• scientific article; zbMATH DE number 7650135 (Why is no real title available?)
• Tensor products of weakly smooth codes are robust

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436324)