Better extractors for better codes?

DOI10.1145/1007352.1007422zbMATH Open1192.68363OpenAlexW2053860959MaRDI QIDQ3580988FDOQ3580988

Authors: Venkatesan Guruswami 

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Decoding (94B35)

Cited In (5)

• Title not available (Why is that?)
• Additive combinatorics: with a view towards computer science and cryptography -- an exposition
• 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
• Extractors from Reed-Muller codes
• Reconstructive dispersers and hitting set generators

This page was built for publication: Better extractors for better codes?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580988)