Composition of Semi-LTCs by Two-Wise Tensor Products

DOI10.1007/978-3-642-03685-9_29zbMATH Open1255.94088OpenAlexW1540200135MaRDI QIDQ3638892FDOQ3638892

Authors: Eli Ben-Sasson, Michael Viderman 

Publication date: 28 October 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03685-9_29

Recommendations

• Composition of semi-LTCs by two-wise tensor products
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• A combination of testability and decodability by tensor products
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Robust locally testable codes and products of codes

Mathematics Subject Classification ID

Decoding (94B35) Other types of codes (94B60)

Cited In (5)

• Combinatorial PCPs with short proofs
• A combination of testability and decodability by tensor products
• 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

This page was built for publication: Composition of Semi-LTCs by Two-Wise Tensor Products

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