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