A Combination of Testability and Decodability by Tensor Products

DOI10.1007/978-3-642-32512-0_55zbMath1315.94131arXiv1105.5806OpenAlexW2402697753MaRDI QIDQ3167434

Michael Viderman

Publication date: 2 November 2012

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

Full work available at URL: https://arxiv.org/abs/1105.5806

zbMATH Keywords

tensor productslocally testable codesefficient decodinglocally correctable codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Related Items (5)

Unnamed Item ⋮ 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 ⋮ Combinatorial PCPs with short proofs

This page was built for publication: A Combination of Testability and Decodability by Tensor Products