Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
暂无分享,去创建一个
[1] Prasad Tetali,et al. Slow mixing of Glauber dynamics for the hard‐core model on regular bipartite graphs , 2006, Random Struct. Algorithms.
[2] Avi Wigderson,et al. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[3] L. Fortnow. Recent Developments in Explicit Constructions of Extractors , 2002 .
[4] Nabil Kahale,et al. Eigenvalues and expansion of regular graphs , 1995, JACM.
[5] Oded Goldreich,et al. Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing (Preliminary Version) , 1997, STOC 1994.
[6] Enkatesan G Uruswami. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes , 2008 .
[7] Noam Nisan,et al. Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..
[8] Christopher Umans. Pseudo-random generators for all hardnesses , 2002, STOC '02.
[9] Aravind Srinivasan,et al. Computing with very weak random sources , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[10] Christopher Umans,et al. Simple extractors for all min-entropies and a new pseudorandom generator , 2005, JACM.
[11] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[12] 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 .
[13] Leonid A. Levin,et al. Pseudo-random generation from one-way functions , 1989, STOC '89.
[14] Zvi Galil,et al. Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..
[15] David Zuckerman,et al. Extractors for Three Uneven-Length Sources , 2008, APPROX-RANDOM.
[16] Ran Raz,et al. Extractors with weak random seeds , 2005, STOC '05.
[17] Christopher Umans,et al. Simple extractors for all min-entropies and a new pseudo-random generator , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[18] Avi Wigderson,et al. Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications , 1993, Comb..
[19] Venkatesan Guruswami,et al. Extractors and condensers from univariate polynomials , 2006, Electron. Colloquium Comput. Complex..
[20] David Zuckerman. Simulating BPP using a general weak random source , 2005, Algorithmica.
[21] Venkatesan Guruswami,et al. Explicit capacity-achieving list-decodable codes , 2005, STOC.
[22] Leonid A. Levin,et al. Pseudo-random Generation from one-way functions (Extended Abstracts) , 1989, STOC 1989.
[23] Enkatesan G Uruswami,et al. Unbalanced expanders and randomness extractors from , 2008 .
[24] Peter Bro Miltersen,et al. Are bitvectors optimal? , 2000, STOC '00.
[25] Roy Armoni,et al. On the Derandomization of Space-Bounded Computations , 1998, RANDOM.
[26] Amnon Ta-Shma,et al. Extractor codes , 2001, IEEE Transactions on Information Theory.
[27] Ran Raz,et al. Extracting all the randomness and reducing the error in Trevisan's extractors , 1999, STOC '99.
[28] Luca Trevisan,et al. Extractors and pseudorandom generators , 2001, JACM.
[29] N. Linial,et al. Expander Graphs and their Applications , 2006 .
[30] A. Wigderson,et al. Disperser graphs, deterministic amplification, and imperfect random sources (גרפים מפזרים, הגברה דטרמיניסטית ומקורות אקראים חלשים.) , 1991 .
[31] Avi Wigderson,et al. Dispersers, deterministic amplification, and weak random sources , 1989, 30th Annual Symposium on Foundations of Computer Science.
[32] David Zuckerman. Randomness-optimal oblivious sampling , 1997, Random Struct. Algorithms.
[33] M. Murty. Ramanujan Graphs , 1965 .
[34] Oded Goldreich,et al. Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..
[35] 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).
[36] Amnon Ta-Shma,et al. Extractors from Reed-Muller Codes , 2001, Electron. Colloquium Comput. Complex..
[37] Harald Niederreiter,et al. Introduction to finite fields and their applications: List of Symbols , 1986 .
[38] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[39] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma , 1999, Electron. Colloquium Comput. Complex..
[40] Venkatesan Guruswami,et al. Combinatorial bounds for list decoding , 2002, IEEE Trans. Inf. Theory.
[41] Venkatesan Guruswami,et al. Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2005, IEEE Transactions on Information Theory.
[42] Victor Shoup,et al. New algorithms for finding irreducible polynomials over finite fields , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[43] Aravind Srinivasan,et al. Computing with Very Weak Random Sources , 1999, SIAM J. Comput..
[44] Peter Bro Miltersen,et al. Are Bitvectors Optimal? , 2002, SIAM J. Comput..
[45] Avi Wigderson,et al. Extracting Randomness via Repeated Condensing , 2006, SIAM J. Comput..
[46] David P. Woodruff,et al. Revisiting Norm Estimation in Data Streams , 2008, ArXiv.
[47] Amnon Ta-Shma,et al. Loss-less condensers, unbalanced expanders, and extractors , 2001, STOC '01.
[48] Russell Impagliazzo,et al. How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.
[49] Amnon Ta-Shma,et al. Lossless Condensers, Unbalanced Expanders, And Extractors , 2007, Comb..
[50] Christopher Umans,et al. On Obtaining Pseudorandomness from Error-Correcting Codes , 2006, FSTTCS.
[51] Avi Wigderson,et al. Extractors and pseudo-random generators with optimal seed length , 2000, STOC '00.
[52] Amnon Ta-Shma,et al. Storing information with extractors , 2002, Inf. Process. Lett..
[53] 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).
[54] Omer Reingold,et al. Randomness Conductors and Constant-Degree Expansion Beyond the Degree / 2 Barrier , 2001 .
[55] Avi Wigderson,et al. Extractors: optimal up to constant factors , 2003, STOC '03.
[56] Dan Suciu,et al. Journal of the ACM , 2006 .
[57] Noam Nisan,et al. Extracting Randomness: A Survey and New Constructions , 1999, J. Comput. Syst. Sci..
[58] Avi Wigderson,et al. Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing , 1997, Electron. Colloquium Comput. Complex..
[59] Jaikumar Radhakrishnan,et al. Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators , 2000, SIAM J. Discret. Math..
[60] Avi Wigderson,et al. Randomness conductors and constant-degree lossless expanders , 2002, STOC '02.