Unbalanced expanders and randomness extractors from parvaresh-vardy codes

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2007, Pages 96-108

  Guruswami, Venkatesan ^a   Umans, Christopher ^b   Vadhan, Salil ^c  

^a University of Washington

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c HARVARD UNIVERSITY   (United States)

Author keywords

Expander graphs; Randomness extractors

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL GEOMETRY; ERROR ANALYSIS; GRAPH THEORY; OPTIMAL SYSTEMS; POLYNOMIALS;

ERROR PARAMETERS; EXPANDER GRAPHS; QUASIPOLYNOMIALS; RANDOMNESS EXTRACTORS;

RANDOM VARIABLES;

EID: 34748894441     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2007.38     Document Type: Conference Paper

References (41)

1. H. Buhrman, P. B. Miltersen, J. Radhakrishnan, and S. Venkatesh. Are bitvectors optimal? SIAM Journal on Computing, 31(6):1723-1744 (electronic), 2002.
2. M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson. Randomness conductors and constant-degree expansion beyond the degree/2 barrier. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 659-668, 2002.
3. B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing, 17(2):230-261, Apr. 1988.
4. A. Cohen and A. Wigderson. Dispersers, deterministic amplification, and weak random sources (extended abstract). In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, pages 14-19, 1989.
5. O. Gabber and Z. Galil. Explicit constructions of linearsized superconcentrators. Journal of Computer and System Sciences, 22(3):407-420, June 1981.
6. D. Gillman. A Chernoff bound for random walks on expander graphs. SIAM J. Comput., 27(4): 1203-1220 (electronic), 1998.
7. V. Guruswami, J. Hastad, M. Sudan, and D. Zuckerman. Combinatorial bounds for list decoding. IEEE Transactions on Information Theory, 48(5):1021-1035, 2002.
8. V. Guruswami and A. Rudra. Explicit capacity-achieving list-decodable codes. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pages 1-10, 2006.
9. V. Guruswami and M. Sudan. Improved decoding of Reed-Solomon and Algebraic-Geometry codes. IEEE Transactions on Information Theory, 45(6):1757-1767, 1999.
10. V. Guruswami, C. Umans, and S. Vadhan. Extractors and condensers from univariate polynomials. Technical Report TR06-134, Electronic Colloquium on Computational Complexity, October 2006.
11. S. Hoory, N. Linial, and A. Wigderson. Expander graphs and their applications. Bull. Amer. Math. Soc. (N.S.), 43(4):439-561 (electronic), 2006.
12. R. Impagliazzo, R. Shaltiel, and A. Wigderson. Extractors and pseudo-random generators with optimal seed length. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 1-10, 2000.
13. R. Impagliazzo and D. Zuckerman. How to recycle random bits. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, pages 248-253, 1989.
14. N. Kahale. Eigenvalues and expansion of regular graphs. Journal of the ACM, 42(5):1091-1106, Sept. 1995.
15. S. Kalyanaraman and C. Umans. On obtaining pseudorandomness from error-correcting codes. In S. Arun-Kumar and N. Garg, editors, FSTTCS, volume 4337 of Lecture Notes in Computer Science, pages 105-116. Springer, 2006.
16. R. Lidl and H. Niederreiter. Introduction to Finite Fields and their applications. Cambridge University Press, 1986.
17. C.-J. Lu, O. Reingold, S. Vadhan, and A. Wigderson. Extractors: Optimal up to constant factors. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 602-611, 2003.
18. A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8(3):261-277, 1988.
19. G. A. Margulis. Explicit constructions of expanders. Problemy Peredači Informacii, 9(4):71-80, 1973.
20. G. A. Margulis. Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators. Problemy Peredachi Informatsii, 24(1):51-60, 1988.
21. N. Nisan and D. Zuckerman. Randomness is linear in space. Journal of Computer and System Sciences, 52(1):43-52, 1996.
22. F. Parvaresh and A. Vardy. Correcting errors beyond the Guruswami-Sudan radius in polynomial time. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pages 285-294, 2005.
23. J. Radhakrishnan and A. Ta-Shma. Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM Journal on Discrete Mathematics, 13(1):2-24 (electronic), 2000.
24. R. Raz. Extractors with weak random seeds. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 11-20, 2005.
25. O. Reingold, R. Shaltiel, and A. Wigderson. Extracting randomness via repeated condensing. SIAM J. Comput., 35(5):1185-1209, 2006.
26. R. Shaltiel. Recent developments in explicit constructions of extractors. Bulletin of the European Association for Theoretical Computer Science, 77:67-, June 2002. Columns: Computational Complexity.
27. R. Shaltiel and C. Umans. Simple extractors for all minentropies and a new pseudorandom generator. Journal of the ACM, 52(2): 172-216, 2005. Conference version appeared in FOCS 2001.
28. V. Shoup. New algorithms for finding irreducible polynomials over finite fields. Mathematics of Computation, 54(189):435-447, 1990.
29. M. Sudan. Decoding of Reed Solomon codes beyond the error-correction bound. J. Complexity, 13(1):180-193, 1997.
30. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the xor lemma. J. Comput. Syst. Sci., 62(2):236-266, 2001.
31. A. Ta-Shma. Storing information with extractors. Inform. Process. Lett., 83(5):267-274, 2002.
32. A. Ta-Shma and C. Umans. Better lossless condensers through derandomized curve samplers. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006. To appear.
33. A. Ta-Shma, C. Umans, and D. Zuckerman. Loss-less condensers, unbalanced expanders, and extractors. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pages 143-152, 2001.
34. A. Ta-Shma and D. Zuckerman. Extractor codes. IEEE Transactions on Information Theory, 50(12):3015-3025, 2004.
35. A. Ta-Shma, D. Zuckerman, and S. Safra. Extractors from Reed-Muller codes. J. Comput. Syst. Sci., 72(5):786-812, 2006.
36. L. Trevisan. Extractors and pseudorandom generators. Journal of the ACM, 48(4):860-879, 2001.
37. C. Umans. Pseudo-random generators for all hardnesses. J. Comput. Syst. Sci., 67(2):419-440, 2003.
38. A. Wigderson and D. Zuckerman. Expanders that beat the eigenvalue bound: Explicit construction and applications. Combinatorica, 19(1):125-138, 1999.
39. D. Zuckerman. Simulating BPP using a general weak random source. Algorithmica, 16(4-5):367-391, 1996.
40. D. Zuckerman. Randomness-optimal oblivious sampling. Random Struct. Algorithms, 11(4):345-367, 1997.
41. D. Zuckerman. Linear degree extractors and the inapproximability of max clique and chromatic number. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pages 681-690, 2006.