Affine extractors over large fields with exponential error
From MaRDI portal
Abstract: We describe a construction of explicit affine extractors over large finite fields with exponentially small error and linear output length. Our construction relies on a deep theorem of Deligne giving tight estimates for exponential sums over smooth varieties in high dimensions.
Recommendations
Cites work
- 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
- Affine extractors over prime fields
- Deterministic extractors for affine sources over large fields
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Extractors and rank extractors for polynomial sources
- Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic
- Extractors for varieties
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- La conjecture de Weil. I
- Minimum distance bounds for cyclic codes and Deligne's theorem
- On exponential sums in finite fields
- On the construction of affine extractors
- Ramanujan graphs
Cited in
(8)- How to extract useful randomness from unreliable sources
- Deterministic extractors for affine sources over large fields
- Analogues of the Balog-Wooley decomposition for subsets of finite fields and character sums with convolutions
- Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic
- scientific article; zbMATH DE number 7706045 (Why is no real title available?)
- Affine extractors over prime fields
- Extractors for polynomial sources over \(\mathbb{F}_2\)
- On the construction of affine extractors
This page was built for publication: Affine extractors over large fields with exponential error
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q347127)
