2-Source dispersers for sub-polynomial entropy and ramsay graphs beating the frankl-wilson construction

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 671-680

  Barak, Boaz ^a   Rao, Anup ^b   Shaltiel, Ronen ^c   Wigderson, Avi ^d  

^a Princeton University   (United States)

^b University of Texas at Austin   (United States)

^c UNIVERSITY OF HAIFA   (Israel)

^d INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Dispersers; Extractors; Independent Sources; Ramsey Graphs

Indexed keywords

DISPERSERS; EXTRACTORS; INDEPENDENT SOURCES; RAMSEY GRAPHS;

ENTROPY; GRAPH THEORY; MACHINERY; MATRIX ALGEBRA; MECHANISMS;

POLYNOMIALS;

EID: 33748118575     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. N. Alon, The shannon capacity of a union. Combinatorica, 18, 1998.
2. ō(log n)-ramsey graph. Technical report, Arxiv, 2006. http://arxiv.org/abs/math.CO/0601651.
3. B. Barak, R. Impagliazzo, and A. Wigderson. Extracting randomness using few independent sources. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pages 384-393, 2004.
4. B. Barak, G. Kindler, R. Shaltiel, B. Sudakov, and A. Wigderson. Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 1-10, 2005.
5. J. Bourgain. More on the sum-product phenomenon in prime fields and its applications. International Journal of Number Theory, 1:1-32, 2005.
6. J. Bourgain, N. Katz, and T. Tao. A sum-product estimate in finite fields, and applications. Geometric and Functional Analysis, 14:27-57, 2004.
7. M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson. Randomness conductors and constant-degree lossless expanders. In Proceedings of the 84th Annual ACM Symposium on Theory of Computing, pages 659-668, 2002.
8. B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing, 17(2):230-261, 1988.
9. P. Frankl and R. M. Wilson. Intersection theorems with geometric consequences. Combinatorica, 1(4):357-368, 1981.
10. P. Gopalan. Constructing ramsey graphs from boolean function representations. In Proceedings of the 21th Annual IEEE Conference on Computational Complexity, 2006.
11. V. Grolmusz. Low rank co-diagonal matrices and ramsey graphs. Electr. J. Comb, 7, 2000.
12. V. Guruswami. Better extractors for better codes? Electronic Colloquium on Computational Complexity (ECCC), (080), 2003.
13. 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.
14. P. Miltersen, N. Nisan, S. Safra, and A. Wigderson. On data structures and asymmetric communication complexity. Journal of Computer and System Sciences, 57:37-49, 1 1998.
15. N. Nisan and D. Zuckerman. More deterministic Simulation in logspace. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 235-244, 1993.
16. P. Pudlak and V. Rodl. Pseudorandom sets and explicit constructions of ramsey graphs. Submitted for publication, 2004.
17. A. Rao. Extractors for a constant number of polynomially small min-entropy independent sources. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006.
18. R. Raz. Extractors with weak random seeds. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 11-20, 2005.
19. O. Reingold, R. Shaltiel, and A. Wigderson. Extracting randomness via repeated condensing. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 22-31, 2000.
20. M. Santha and U. V. Vazirani. Generating quasi-random sequences from semi-random sources. Journal of Computer and System Sciences, 33:75-87, 1986.
21. R. Shaltiel. Recent developments in explicit constructions of extractors. Bulletin of the European Association for Theoretical Computer Science, 77:67-95, 2002.
22. A. Ta-Shma and D. Zuckerman. Extractor codes. IEEE Transactions on Information Theory, 50, 2004.
23. U. Vazirani. Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources (extended abstract). In Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pages 366-378, 1985.
24. A. Wigderson and D. Zuckerman. Expanders that beat the eigenvalue bound: Explicit construction and applications. Combinatorica, 19(1):125-138, 1999.