List decoding algorithms for certain concatenated codes
From MaRDI portal
Publication:3191984
DOI10.1145/335305.335327zbMath1296.94170OpenAlexW2116231125MaRDI QIDQ3191984
Madhu Sudan, Venkatesan Guruswami
Publication date: 26 September 2014
Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/335305.335327
Related Items (10)
On the complexity of approximating the VC dimension. ⋮ Reconstructive dispersers and hitting set generators ⋮ List Decoding of Binary Codes–A Brief Survey of Some Recent Results ⋮ Hardness amplification within NP against deterministic algorithms ⋮ Computational wiretap coding from indistinguishability obfuscation ⋮ Explicit constructions of RIP matrices and related problems ⋮ On the complexity of compressing obfuscation ⋮ New constructions for IPP codes ⋮ Pseudo-random generators for all hardnesses ⋮ Storing information with extractors.
This page was built for publication: List decoding algorithms for certain concatenated codes
