Extractors for three uneven-length sources

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5171 LNCS, Issue , 2008, Pages 557-570

  Rao, Anup ^a   Zuckerman, David ^b  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OP-TIMIZATION PROBLEM; MIN-ENTROPY; SOURCE EXTRACTOR; TWO SOURCES;

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; LEARNING SYSTEMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; RANDOM PROCESSES;

APPROXIMATION ALGORITHMS;

EID: 51849152393     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85363-3_44     Document Type: Conference Paper

References (25)

1. Barak, B., Impagliazzo, R., Wigderson, A.: Extracting randomness using few independent sources. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 384-393 (2004)
2. Barak, B., Kindler, G., Shaltiel, R., Sudakov, B., Wigderson, A.: Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 1-10 (2005)
3. o(1) entropy and Ramsey graphs beating the Frankl-Wilson construction. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (2006)
4. Bourgain, J.: More on the sum-product phenomenon in prime fields and its applications. International Journal of Number Theory 1, 1-32 (2005)
5. Capalbo, M., Reingold, O., Vadhan, S., Wigderson, A.: Randomness conductors and constant-degree lossless expanders. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 659-668 (2002)
6. Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing 17(2), 230-261 (1988)
7. Guruswami, V.: Better extractors for better codes? In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 436-444 (2004)
8. Guruswami, V., Rudra, A.: Explicit capacity-achieving list-decodable codes. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (2006)
9. Guruswami, V., Umans, C., Vadhan, S.: Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. In: Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (2007)
10. Kalai, Y., Li, X., Rao, A., Zuckerman, D.: Network extractor protocols (unpublished manuscript, 2008)
11. Kamp, J., Rao, A., Vadhan, S., Zuckerman, D.: Deterministic extractors for small space sources. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (2006)
12. Lu, C.J., Reingold, O., Vadhan, S., Wigderson, A.: Extractors: Optimal up to constant factors. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pp. 602-611 (2003)
13. Lu, C.-J.: Encryption against storage-bounded adversaries from on-line strong extractors. J. Cryptology 17(1), 27-42 (2004)
14. Miltersen, P., Nisan, N., Safra, S., Wigderson, A.: On data structures and asymmetric communication complexity. Journal of Computer and System Sciences 57, 37-49 (1998)
15. Nisan, N., Zuckerman, D.: Randomness is linear in space. Journal of Computer and System Sciences 52(1), 43-52 (1996)
16. Parvaresh, F., Vardy, A.: Correcting errors beyond the guruswami-sudan radius in polynomial time. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 285-294 (2005)
17. Rao, A.: 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. Raz, R.: Extractors with weak random seeds. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 11-20 (2005)
19. Santha, M., Vazirani, U.V.: Generating quasi-random sequences from semi-random sources. Journal of Computer and System Sciences 33, 75-87 (1986)
20. Shaltiel, R.: How to get more mileage from randomness extractors. In: Proceedings of the 21th Annual IEEE Conference on Computational Complexity, pp. 49-60 (2006)
21. Ta-Shma, A., Zuckerman, D.: Extractor codes. IEEE Transactions on Information Theory 50 (2004)
22. Vadhan, S.P.: Constructing locally computable extractors and cryptosystems in the bounded-storage model. J. Cryptology 17(1), 43-77 (2004)
23. Wigderson, A., Zuckerman, D.: Expanders that beat the eigenvalue bound: Explicit construction and applications. Combinatorica 19(1), 125-138 (1999)
24. Zuckerman, D.: Simulating BPP using a general weak random source. Algorithmica 16, 367-391 (1996)
25. Zuckerman, D.: Randomness-optimal oblivious sampling. Random Structures and Algorithms 11, 345-367 (1997)