The tensor product of two good codes is not necessarily robustly testable
From MaRDI portal
Publication:436324
DOI10.1016/J.IPL.2012.01.007zbMATH Open1243.94046OpenAlexW2030221686MaRDI QIDQ436324FDOQ436324
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
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
- Nearly-linear size holographic proofs
- Tensor products of weakly smooth codes are robust
- A combination of testability and decodability by tensor products
- Locally testable codes and PCPs of almost-linear length
- Robust Local Testability of Tensor Products of LDPC Codes
- Short PCPs with Polylog Query Complexity
- Composition of Semi-LTCs by Two-Wise Tensor Products
- 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
- Title not available (Why is that?)
- Short locally testable codes and proofs
- Combinatorial construction of locally testable codes
- On the rectangle method in proofs of robustness of tensor products
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Cited In (12)
- A combination of testability and decodability by tensor products
- On the rectangle method in proofs of robustness of tensor products
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Tensor products of weakly smooth codes are robust
- Title not available (Why is that?)
- Tensor Products of Weakly Smooth Codes Are Robust
- On axis-parallel tests for tensor product codes
- Composition of semi-LTCs by two-wise tensor products
- On axis-parallel tests for tensor product codes
- Robust Local Testability of Tensor Products of LDPC Codes
- Local list recovery of high-rate tensor codes and applications
- Explicit strong LTCs with inverse poly-log rate and constant soundness
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)
