Better extractors for better codes?
From MaRDI portal
Publication:3580988
DOI10.1145/1007352.1007422zbMath1192.68363OpenAlexW2053860959MaRDI QIDQ3580988
Publication date: 15 August 2010
Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1007352.1007422
Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Decoding (94B35)
Related Items (5)
Reconstructive dispersers and hitting set generators ⋮ 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction ⋮ Extractors from Reed-Muller codes ⋮ Unnamed Item ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
This page was built for publication: Better extractors for better codes?
