Tensor products of weakly smooth codes are robust

DOI10.4086/TOC.2009.V005A012MaRDI QIDQ3002812zbMATH OpenOpenAlexFDO

Authors Eli Ben-Sasson, Michael Viderman

Publication date 24 May 2011

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/toc.2009.v005a012

zbMATH Keywords

expander codelinear codetensor code

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Theory of computing (68Q99) 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

Cited in

(15)

• Combinatorial PCPs with short proofs
• Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting)
• A combinatorial characterization of smooth LTCs and applications
• 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
• Composition of semi-LTCs by two-wise tensor products
• Explicit strong LTCs with inverse poly-log rate and constant soundness
• Local list recovery of high-rate tensor codes and applications
• On axis-parallel tests for tensor product codes
• A combination of testability and decodability by tensor products
• scientific article; zbMATH DE number 7650135 (Why is no real title available?)
• Phase transitions of structured codes of graphs
• Good locally testable 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 Q3002812)