Extractors for Polynomial Sources over Fields of Constant Order and Small Characteristic

A polynomial source of randomness over F n is a random variable X = f(Z) where f is a polynomial map and Z is a random variable distributed uniformly over F r for some integer r. The three main parameters of interest associated with a polynomial source are the order q of the field, the (total) degree D of the map f , and the base-q logarithm of the size of the range of f over inputs in F r , denoted by k. For simplicity we call X a (q; D; k)-source.

[1]  Xiang-dong Hou,et al.  A Generalization of an Addition Theorem of Kneser , 2002 .

[2]  Ran Raz,et al.  Deterministic extractors for affine sources over large fields , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[3]  Avi Wigderson,et al.  Extractors And Rank Extractors For Polynomial Sources , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[4]  Eli Ben-Sasson,et al.  Affine Dispersers from Subspace Polynomials , 2012, SIAM J. Comput..

[5]  W. Schmidt.  Equations over Finite Fields: An Elementary Approach , 1976 .

[6]  A. Weil.  On Some Exponential Sums. , 1948, Proceedings of the National Academy of Sciences of the United States of America.

[7]  Eli Ben-Sasson,et al.  From affine to two-source extractors via approximate duality , 2011, STOC '11.

[8]  Oded Goldreich,et al.  Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..

[9]  Anindya De,et al.  Extractors and Lower Bounds for Locally Samplable Sources , 2011, TOCT.

[10]  H. Niederreiter,et al.  Introduction to finite fields and their applications: Factorization of Polynomials , 1994 .

[11]  Xin Li,et al.  A New Approach to Affine Extractors and Dispersers , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

[12]  Shachar Lovett,et al.  Subspace Evasive Sets , 2011, Electron. Colloquium Comput. Complex..

[13]  Ronen Shaltiel,et al.  Dispersers for Affine Sources with Sub-polynomial Entropy , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[14]  Jean Bourgain,et al.  On the Construction of Affine Extractors , 2007 .

[15]  Zeev Dvir.  Extractors for varieties , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[16]  Eli Ben-Sasson,et al.  From affine to two-source extractors via approximate duality , 2011, STOC '11.

[17]  Amir Yehudayoff,et al.  Affine extractors over prime fields , 2011, Comb..

[18]  Emanuele Viola,et al.  Extractors for Circuit Sources , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[19]  Eli Ben-Sasson,et al.  Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic , 2012, APPROX-RANDOM.

[20]  Wolfgang M. Schmidt,et al.  Bounds for exponential sums , 1984 .

[21]  Venkatesan Guruswami,et al.  Linear-Algebraic List Decoding of Folded Reed-Solomon Codes , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

[22]  Jitsuro Nagura.  On the interval containing at least one prime number , 1952 .

[23]  Matt DeVos,et al.  Simple Affine Extractors Using Dimension Expansion , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

[24]  Alexander S. Kulikov,et al.  An Elementary Proof of a 3n - o(n) Lower Bound on the Circuit Complexity of Affine Dispersers , 2011, MFCS.

[25]  Eli Ben-Sasson,et al.  Affine dispersers from subspace polynomials , 2009, STOC '09.

[26]  Norbert Blum.  A Boolean Function Requiring 3n Network Size , 1984, Theor. Comput. Sci..

[27]  L. Carlitz,et al.  Bounds for exponential sums , 1957 .

[28]  Anup Rao,et al.  An Exposition of Bourgain's 2-Source Extractor , 2007, Electron. Colloquium Comput. Complex..