Robust Local Testability of Tensor Products of LDPC Codes
From MaRDI portal
Publication:3595411
DOI10.1007/11830924_29zbMath1155.94402OpenAlexW2056759312MaRDI QIDQ3595411
Irit Dinur, Avi Wigderson, Madhu Sudan
Publication date: 28 August 2007
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/11830924_29
Related Items (12)
Faster sounder succinct arguments and \textsf{IOP}s ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Local List Recovery of High-Rate Tensor Codes and Applications ⋮ 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 ⋮ Tensor Products of Weakly Smooth Codes Are Robust ⋮ Composition of semi-LTCs by two-wise tensor products ⋮ Unnamed Item ⋮ Testing algebraic geometric codes ⋮ Combinatorial PCPs with short proofs
This page was built for publication: Robust Local Testability of Tensor Products of LDPC Codes
