Local list-decoding and testing of random linear codes from high error
From MaRDI portal
Publication:2875169
DOI10.1145/1806689.1806748zbMath1293.94129OpenAlexW2092889253MaRDI QIDQ2875169
Swastik Kopparty, Shubhangi Saraf
Publication date: 13 August 2014
Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1806689.1806748
Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05) Decoding (94B35)
Related Items (6)
Can we locally compute sparse connected subgraphs? ⋮ Relaxed Locally Correctable Codes ⋮ Composition of semi-LTCs by two-wise tensor products ⋮ Sparse affine-invariant linear codes are locally testable ⋮ Limitation on the Rate of Families of Locally Testable Codes ⋮ A combination of testability and decodability by tensor products
This page was built for publication: Local list-decoding and testing of random linear codes from high error
