Tensor Products of Weakly Smooth Codes Are Robust

DOI10.1007/978-3-540-85363-3_24MaRDI QIDQ3541803zbMATH OpenOpenAlexFDO

Authors Eli Ben-Sasson, Michael Viderman

Publication date 27 November 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85363-3_24

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Tensor products of weakly smooth codes are robust
• Robust Local Testability of Tensor Products of LDPC Codes
• The tensor product of two good codes is not necessarily robustly testable
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Cites work

• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Combinatorial construction of locally testable codes
• Linear-time encodable and decodable error-correcting codes
• Locally testable codes and PCPs of almost-linear length
• Robust Local Testability of Tensor Products of LDPC Codes
• The tensor product of two good codes is not necessarily robustly testable

Cited in

(5)

• Tensor products of weakly smooth codes are robust
• Robust Local Testability of Tensor Products of LDPC Codes
• The tensor product of two good codes is not necessarily robustly testable
• On the rectangle method in proofs of robustness of tensor products
• On axis-parallel tests for tensor product codes

This page was built for publication: Tensor Products of Weakly Smooth Codes Are Robust

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