Affine extractors over large fields with exponential error
- 2 September 2015
- journal article
- Published by Springer Nature in computational complexity
- Vol. 25 (4) , 921-931
Abstract
No abstract availableKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic2012
- Extractors for varietiescomputational complexity, 2011
- Affine extractors over prime fieldsCombinatorica, 2011
- On Exponential Sums in Finite Fields2010
- Extractors And Rank Extractors For Polynomial Sourcescomputational complexity, 2009
- Deterministic extractors for affine sources over large fieldsCombinatorica, 2008
- On the Construction of Affine ExtractorsGeometric and Functional Analysis, 2007
- Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree ExpandersAnnals of Mathematics, 2002
- Minimum distance bounds for cyclic codes and Deligne's theoremIEEE Transactions on Information Theory, 1993
- Ramanujan graphsCombinatorica, 1988