Extractor Codes
From MaRDI portal
Publication:3547686
DOI10.1109/TIT.2004.838377zbMATH Open1298.94148DBLPjournals/tit/Ta-ShmaZ04WikidataQ62398478 ScholiaQ62398478MaRDI QIDQ3547686FDOQ3547686
Authors: Amnon Ta-Shma, David Zuckerman
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
Channel models (including quantum) in information and communication theory (94A40) Other types of codes (94B60)
Cited In (17)
- Title not available (Why is that?)
- On hitting-set generators for polynomials that vanish rarely
- Title not available (Why is that?)
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
- The complexity of the matroid-greedoid partition problem
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions
- Local List Recovery of High-Rate Tensor Codes and Applications
- Title not available (Why is that?)
- STACS 2005
- Extracting Computational Entropy and Learning Noisy Linear Functions
- Storing information with extractors.
- Extractors from Reed-Muller codes
- Reconstructive dispersers and hitting set generators
- An introduction to randomness extractors
- Non-malleability against polynomial tampering
- Nearly optimal pseudorandomness from hardness
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
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)