Extractor Codes

DOI10.1109/TIT.2004.838377MaRDI QIDQ3547686zbMATH OpenDBLPWikidataFDO

Authors Amnon Ta-Shma, David Zuckerman

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

error-correcting codes for highly noisy channelsTrevisan's extractor

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Other types of codes (94B60)

Recommendations

• Extractor codes
• Error-correcting codes for list decoding
• List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Linear time encodable and list decodable codes

Cited in

(18)

• On hitting-set generators for polynomials that vanish rarely
• scientific article; zbMATH DE number 1543340 (Why is no real title available?)
• Storing information with extractors.
• scientific article; zbMATH DE number 1833397 (Why is no real title available?)
• Nearly optimal pseudorandomness from hardness
• Additive combinatorics: with a view towards computer science and cryptography -- an exposition
• An introduction to randomness extractors
• Non-malleability against polynomial tampering
• Extractors from Reed-Muller codes
• The complexity of the matroid-greedoid partition problem
• Extractor codes
• Reconstructive dispersers and hitting set generators
• Incompressible functions, relative-error extractors, and the power of nondeterministic reductions
• Extracting Computational Entropy and Learning Noisy Linear Functions
• Local list recovery of high-rate tensor codes and applications
• On hitting-set generators for polynomials that vanish rarely
• STACS 2005
• 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction

This page was built for publication: Extractor Codes

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