Tensor Products of Weakly Smooth Codes Are Robust

DOI10.1007/978-3-540-85363-3_24zbMath1159.94378OpenAlexW2162229947MaRDI QIDQ3541803

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)

Related Items (1)

Unnamed Item

Cites Work

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

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