Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes

Journal of the ACM

Volumn 56, Issue 4, 2009, Pages

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

^a Carnegie Mellon University   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c HARVARD UNIVERSITY   (United States)

Author keywords

Condensers; Error correcting codes; Expander graphs; List decoding; Randomness extractors

Indexed keywords

CONDENSERS; ERROR-CORRECTING CODES; EXPANDER GRAPHS; LIST DECODING; RANDOMNESS EXTRACTORS;

ARTIFICIAL INTELLIGENCE; CONDENSERS (LIQUEFIERS); DECODING; LUTETIUM; OPTIMIZATION; SIGNAL THEORY; TANTALUM;

GRAPH THEORY;

EID: 68549120859     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1538902.1538904     Document Type: Article

References (51)

1. ARMONI, R. 1998. On the derandomization of space-bounded computations. In RANDOM, M. Luby, J. D. P. Rolim, and M. J. Serna, Eds. Lecture Notes in Computer Science, vol. 1518. Springer-Verlag, Berlin, Germany, 47-59.
2. BUHRMAN, H., MILTERSEN, P. B., RADHAKRISHNAN, J., AND VENKATESH, S. 2002. Are bitvectors optimal? SIAM J. Comput. 31, 6, 1723-1744 (electronic).
3. CAPALBO, M., REINGOLD, O., VADHAN, S., AND WIGDERSON, A. 2002. Randomness conductors and constant-degree expansion beyond the degree/2 barrier. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing. ACM, New York, 659-668.
4. CHOR, B., AND GOLDREICH, O. 1988. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Computing 17, 2 (Apr.), 230-261.
5. COHEN, A., AND WIGDERSON, A. 1989. Dispersers, deterministic amplification, and weak random sources (extended abstract). In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, 14-19.
6. GABBER, O., AND GALIL, Z. 1981. Explicit constructions of linear-sized superconcentrators. J. Comput. Syst. Sci. 22, 3 (June), 407-420.
7. GALVIN, D., AND TETALI, P. 2006. Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs. Rand. Struct. Algor. 28, 4, 427-443.
8. GILLMAN, D. 1998. A Chernoff bound for random walks on expander graphs. SIAM J. Comput. 27, 4, 1203-1220 (electronic).
9. GOLDREICH, O., ANDWIGDERSON, A. 1997. Tiny familiesoffunctions with random properties:Aquality-size trade-off for hashing. Rand. Struct. Algor. 11, 4, 315-343.
10. GURUSWAMI, V., HASTAD, J., SUDAN, M., AND ZUCKERMAN, D. 2002. Combinatorial bounds for list decoding. IEEE Trans. Inf. Theory 48, 5, 1021-1035.
11. GURUSWAMI, V., AND RUDRA, A. 2008. Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy. IEEE Transactions on Information Theory 54, 1 (Jan.), 135-150. (Preliminary version appeared in STOC 2006.)
12. GURUSWAMI, V., AND SUDAN, M. 1999. Improved decoding of Reed-Solomon and Algebraic-Geometry codes. IEEE Trans. Inf. Theory 45, 6, 1757-1767.
13. GURUSWAMI, V., UMANS, C., AND VADHAN, S. 2006. Extractors and condensers from univariate polynomials. Tech. Rep. TR06-134, Electronic Colloquium on Computational Complexity. October.
14. GURUSWAMI, V., UMANS, C., AND VADHAN, S. 2007. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. In Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC '07). IEEE Computer Society Press, Los Alamitos, 96-108.
15. HOORY, S., LINIAL, N., AND WIGDERSON, A. 2006. Expander graphs and their applications. Bull. Amer. Math. Soc. (N.S.) 43, 4, 439-561 (electronic).
16. IMPAGLIAZZO, R., LEVIN, L. A., AND LUBY,M. 1989. Pseudo-random generation from one-way functions (extended abstracts). In Proceedings of the 21st Annual ACM Symposium on Theory of Computing. ACM, New York, 12-24.
17. IMPAGLIAZZO, R., SHALTIEL, R., AND WIGDERSON, A. 2000. Extractors and pseudo-random generators with optimal seed length. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing. ACM, New York, 1-10.
18. IMPAGLIAZZO, R., AND ZUCKERMAN, D. 1989. How to recycle random bits. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science. 248-253.
19. KAHALE, N. 1995. Eigenvalues and expansion of regular graphs. J. ACM 42, 5 (Sept.), 1091-1106.
20. KALYANARAMAN, S. AND UMANS, C. 2006. On obtaining pseudo-randomness from error-correcting codes. In FSTTCS, S. Arun-Kumar and N. Garg, Eds. Lecture Notes in Computer Science, vol. 4337. Springer-Verlag, New York, 105-116.
21. LIDL, R., AND NIEDERREITER, H. 1986. Introduction to Finite Fields and Their applications. Cambridge University Press, Cambridge.
22. LU, C.-J., REINGOLD, O., VADHAN, S., AND WIGDERSON, A. 2003. Extractors: Optimal up to constant factors. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing. ACM, New York, 602-611.
23. LUBOTZKY, A., PHILLIPS, R., AND SARNAK, P. 1988. Ramanujan graphs. Combinatorica 8, 3, 261-277.
24. MARGULIS, G. A. 1973. Explicit constructions of expanders. Probl. Peredači Inf. 9, 4, 71-80.
25. MARGULIS, G. A. 1988. Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators. Probl. Peredachi Inf. 24, 1, 51-60.
26. NELSON, J., AND WOODRUFF, D. P. 2008. Revisiting norm estimation in data streams. CoRR abs/0811.3648.
27. NISAN, N., AND TA-SHMA, A. 1999. Extracting randomness: A survey and new constructions. J. Comput. Syst. Sci. 58, 1 (Feb.), 148-173.
28. NISAN, N., AND ZUCKERMAN, D. 1996. Randomness is linear in space. J. Comput. Syst. Sci. 52, 1, 43-52.
29. PARVARESH, F., AND VARDY, A. 2005. Correcting errors beyond the Guruswami-Sudan radius in polynomial time. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, 285-294.
30. RADHAKRISHNAN, J., AND TA-SHMA, A. 2000. Bounds for dispersers, extractors, and depth-two super-concentrators. SIAM J. Disc. Math. 13, 1, 2-24 (electronic).
31. RAO, A., AND ZUCKERMAN, D. 2008. Extractors for three uneven-length sources. In Proceedings of the 12th Workshop on Approximation, Randomization and Combinatorial Optimization (RANDOM). Springer-Verlag, Berlin, Germany, 557-570.
32. RAZ, R., REINGOLD, O., AND VADHAN, S. 2002. Extracting all the randomness and reducing the error in Trevisan's extractors. J. Comput. Syst. Sci. 65, 1 (Aug.), 97-128. (Special Issue on STOC '99.)
33. REINGOLD, O., SHALTIEL, R., AND WIGDERSON, A. 2006. Extracting randomness via repeated condensing. SIAM J. Comput. 35, 5, 1185-1209.
34. REINGOLD, O., VADHAN, S. P., AND WIGDERSON, A. 2001. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. Electron. Colloq. Comput. Complex. (ECCC) 8, 18.
35. SHALTIEL, R. 2002. Recent developments in explicit constructions of extractors. Bull. European Assoc. Theoret. Comput. Sci. 77, 67-. Columns: Computational Complexity.
36. SHALTIEL, R., AND UMANS, C. 2005. Simple extractors for all min-entropies and a new pseudo-random generator. J. ACM 52, 2, 172-216. (Conference version appeared in FOCS 2001.)
37. SHOUP, V. 1990. New algorithms for finding irreducible polynomials over finite fields. Math. Comput. 54, 189, 435-447.
38. SRINIVASAN, A., AND ZUCKERMAN, D. 1999. Computing with very weak random sources. SIAM J. Comput. 28, 1433-1459.
39. SUDAN, M. 1997. Decoding of Reed-Solomon codes beyond the error-correction bound. J. Complexity 13, 1, 180-193.
40. SUDAN, M., TREVISAN, L., AND VADHAN, S. 2001. Pseudo-random generators without the XOR lemma. J. Comput. Syst. Sci. 62, 2, 236-266.
41. TA-SHMA, A. 2002. Storing information with extractors. Inform. Process. Lett. 83, 5, 267-274.
42. TA-SHMA, A., AND UMANS,C. 2006. Better lossless condensers through derandomized curve samplers. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, 177-186.
43. TA-SHMA, A., UMANS, C., AND ZUCKERMAN, D. 2007. Lossless condensers, unbalanced expanders, and extractors. Combinatorica 27, 2, 213-240.
44. TA-SHMA, A., AND ZUCKERMAN, D. 2004. Extractor codes. IEEE Trans. Inf. Theory 50, 12, 3015-3025.
45. TA-SHMA, A., ZUCKERMAN, D., AND SAFRA, S. 2006. Extractors from Reed-Muller codes. J. Comput. Syst. Sci. 72, 5, 786-812.
46. TREVISAN, L. 2001. Extractors and pseudorandom generators. J. ACM 48, 4, 860-879.
47. UMANS, C. 2003. Pseudo-random generators for all hardnesses. J. Comput. Syst. Sci. 67, 2, 419-440.
48. WIGDERSON, A., AND ZUCKERMAN, D. 1999. Expanders that beat the eigenvalue bound: Explicit construction and applications. Combinatorica 19, 1, 125-138.
49. ZUCKERMAN, D. 1996. Simulating BPP using a general weak random source. Algorithmica 16, 4-5, 367-391.
50. ZUCKERMAN, D. 1997. Randomness-optimal oblivious sampling. Random Struct. Algorithms 11, 4, 345-367.
51. ZUCKERMAN, D. 2006. Linear degree extractors and the inapproximability of max clique and chromatic number. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing. ACM, New York, 681-690.