The following pages link to Extractors from Reed-Muller codes (Q2496317):
Displaying 16 items.
- Extracting Kolmogorov complexity with applications to dimension zero-one laws (Q716318) (← links)
- Robustly reusable fuzzy extractor with imperfect randomness (Q831183) (← links)
- On the complexity of approximating the VC dimension. (Q1872731) (← links)
- On hitting-set generators for polynomials that vanish rarely (Q2099672) (← links)
- Simple extractors via constructions of cryptographic pseudo-random generators (Q2268098) (← links)
- Deterministic extractors for affine sources over large fields (Q2390150) (← links)
- Reconstructive dispersers and hitting set generators (Q2391190) (← links)
- A modular framework for quantum-proof randomness extractors (Q2400201) (← links)
- An Introduction to Randomness Extractors (Q3012907) (← links)
- Another Motivation for Reducing the Randomness Complexity of Algorithms (Q3088202) (← links)
- Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators (Q3644215) (← links)
- Local List Recovery of High-Rate Tensor Codes and Applications (Q5117374) (← links)
- Reed-Muller Codes (Q5870775) (← links)
- (Q5875519) (← links)
- Pseudo-random generators for all hardnesses (Q5917585) (← links)
- (Q6084350) (← links)
