Unbalanced expanders and randomness extractors from

We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of vertices). Both the degree and the number of right-hand vertices are polynomially close to optimal, whereas the previous constructions of Ta-Shma, Umans, and Zuckerman (STOC ‘01) required at least one of these to be quasipolynomial in the optimal. Our expanders have a short and self-contained description and analysis, based on the ideas underlying the recent list-decodable error-correcting codes of Parvaresh and Vardy (FOCS ‘05). Our expanders can be interpreted as near-optimal “randomness condensers,” that reduce the task of extracting randomness from sources of arbitrary min-entropy rate to extracting randomness from sources of min-entropy rate arbitrarily close to 1, which is a much easier task. Using this connection, we obtain a new, self-contained construction of randomness extractors that is optimal up to constant factors, while being much simpler than the previous construction of Lu et al. (STOC ‘03) and improving upon it when the error parameter is small (e.g. 1/poly(n)).

[1]  Avi Wigderson,et al.  Extracting Randomness via Repeated Condensing , 2006, SIAM J. Comput..

[2]  Amnon Ta-Shma,et al.  Extractors from Reed-Muller codes , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[3]  Luca Trevisan,et al.  Extractors and pseudorandom generators , 2001, JACM.

[4]  Avi Wigderson,et al.  Extractors and pseudo-random generators with optimal seed length , 2000, STOC '00.

[5]  David Zuckerman,et al.  Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[6]  Leonid A. Levin,et al.  Pseudo-random Generation from one-way functions (Extended Abstracts) , 1989, STOC 1989.

[7]  Noam Nisan,et al.  Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..

[8]  Venkatesan Guruswami,et al.  Combinatorial bounds for list decoding , 2002, IEEE Trans. Inf. Theory.

[9]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: Preface , 1994 .

[10]  D. Zuckerman,et al.  Randomness-optimal oblivious sampling , 1997, Random Struct. Algorithms.

[11]  Enkatesan G Uruswami.  Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes , 2008 .

[12]  Christopher Umans,et al.  Pseudo-random generators for all hardnesses , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[13]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.

[14]  Avi Wigderson,et al.  Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing , 1997, Electron. Colloquium Comput. Complex..

[15]  Venkatesan Guruswami,et al.  Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2005, IEEE Transactions on Information Theory.

[16]  Prasad Tetali,et al.  Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs , 2006 .

[17]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[18]  Luca Trevisan,et al.  Pseudorandom generators without the XOR lemma , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[19]  Avi Wigderson,et al.  Extractors: optimal up to constant factors , 2003, STOC '03.

[20]  A. Lubotzky,et al.  Ramanujan graphs , 2017, Comb..

[21]  Noam Nisan,et al.  Extracting Randomness: A Survey and New Constructions , 1999, J. Comput. Syst. Sci..

[22]  Victor Shoup,et al.  New algorithms for finding irreducible polynomials over finite fields , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[23]  Alexander Vardy,et al.  Correcting errors beyond the Guruswami-Sudan radius in polynomial time , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[24]  Avi Wigderson,et al.  Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications , 1999, Comb..

[25]  Ran Raz,et al.  Extracting all the randomness and reducing the error in Trevisan's extractors , 1999, STOC '99.

[26]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[27]  Aravind Srinivasan,et al.  Computing with very weak random sources , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[28]  Peter Bro Miltersen,et al.  Are Bitvectors Optimal? , 2002, SIAM J. Comput..

[29]  Christopher Umans,et al.  On Obtaining Pseudorandomness from Error-Correcting Codes , 2006, FSTTCS.

[30]  Russell Impagliazzo,et al.  How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[31]  Omer Reingold,et al.  Randomness Conductors and Constant-Degree Expansion Beyond the Degree / 2 Barrier , 2001 .

[32]  Amnon Ta-Shma,et al.  Loss-less condensers, unbalanced expanders, and extractors , 2001, STOC '01.

[33]  Amnon Ta-Shma,et al.  Storing information with extractors , 2002, Inf. Process. Lett..

[34]  Amnon Ta-Shma,et al.  Better lossless condensers through derandomized curve samplers , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[35]  David Zuckerman.  Simulating BPP using a general weak random source , 2005, Algorithmica.

[36]  Jaikumar Radhakrishnan,et al.  Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators , 2000, SIAM J. Discret. Math..

[37]  Amnon Ta-Shma,et al.  Extractor codes , 2001, IEEE Transactions on Information Theory.