The following pages link to Extractor Codes (Q3547686):
Displaying 11 items.
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- The complexity of the matroid-greedoid partition problem (Q1006060) (← links)
- Storing information with extractors. (Q1853081) (← links)
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction (Q1928613) (← links)
- On hitting-set generators for polynomials that vanish rarely (Q2099672) (← links)
- Non-malleability against polynomial tampering (Q2102059) (← links)
- Reconstructive dispersers and hitting set generators (Q2391190) (← links)
- Extractors from Reed-Muller codes (Q2496317) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- An Introduction to Randomness Extractors (Q3012907) (← links)
- (Q6084350) (← links)
