Extractors from Reed-Muller codes

Journal of Computer and System Sciences

Volumn 72, Issue 5, 2006, Pages 786-812

  Ta Shma, Amnon ^a   Zuckerman, David ^b   Safra, Shmuel ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b University of Texas at Austin   (United States)

Author keywords

Derandomization; Expanders; Extractors; Inapproximability; Pseudorandomness; Reed Muller codes

Indexed keywords

APPROXIMATION THEORY; ENGINEERING RESEARCH; POLYNOMIALS; RANDOM PROCESSES;

DERANDOMIZATION; EXPANDERS; EXTRACTORS; INAPPROXIMABILITY; PSEUDORANDOMNESS; REED-MULLER CODES;

CODES (SYMBOLS);

EID: 33646520833     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2005.05.010     Document Type: Article

References (34)

1. Mossel E., and Umans C. On the complexity of approximating the VC dimension. J. Comput. System Sci. 65 (2002) 660-671
2. Sipser M. Expanders, randomness, or time vs. space. J. Comput. System Sci. 36 (1988) 379-383
3. Santha M. On using deterministic functions in probabilistic algorithms. Inform. and Comput. 74 3 (1987) 241-249
4. Nisan N., and Zuckerman D. Randomness is linear in space. J. Comput. System Sci. 52 1 (1996) 43-52
5. D. Zuckerman, General weak random sources, in: Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, 1990, pp. 534-543
6. Zuckerman D. Simulating BPP using a general weak random source. Algorithmica 16 (1996) 367-391
7. Srinivasan A., and Zuckerman D. Computing with very weak random sources. SIAM J. Comput. 28 (1999) 1433-1459
8. A. Ta-Shma, On extracting randomness from weak random sources, in: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 276-285
9. Zuckerman D. Randomness-optimal oblivious sampling. Random Structures Algorithms 11 (1997) 345-367
10. Trevisan L. Extractors and pseudorandom generators. J. ACM 48 4 (2001) 860-879
11. Nisan N., and Wigderson A. Hardness vs. randomness. J. Comput. System Sci. 49 (1994) 149-167
12. R. Impagliazzo, R. Shaltiel, A. Wigderson, Near-optimal conversion of hardness into pseudo-randomness, in: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999, pp. 181-190
13. R. Impagliazzo, R. Shaltiel, A. Wigderson, Extractors and pseudo-random generators with optimal seed length, in: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 2000, pp. 1-10
14. O. Reingold, R. Shaltiel, A. Wigderson, Extracting randomness via repeated condensing, in: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 22-31
15. A. Ta-Shma, C. Umans, D. Zuckerman, Loss-less condensers, unbalanced expanders, and extractors, in: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 143-152
16. Radhakrishnan J., and Ta-Shma A. Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM J. Discrete Math. 13 1 (2000) 2-24
17. Wigderson A., and Zuckerman D. Expanders that beat the eigenvalue bound: Explicit construction and applications. Combinatorica 19 1 (1999) 125-138
18. p minimization problems, in: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999, pp. 465-474
19. * n + O ( 1 ) rounds. J. Comput. System Sci. 63 (2001) 612-626
20. O. Goldreich, D. Zuckerman, Another proof that BPP ⊆ PH (and more), Technical report TR97-045, Electronic Colloquium on Computational Complexity, 1997
21. Ta-Shma A., and Zuckerman D. Extractor codes. IEEE Trans. Inform. Theory 50 (2004) 3015-3025
22. 1 - ε{lunate}. Acta Math. 182 (1999) 105-142
23. V. Guruswami, Better extractors for better codes?, in: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004, pp. 436-444
24. D. Zuckerman, Linear degree extractors and inapproximability, manuscript, 2005
25. R. Shaltiel, C. Umans, Simple extractors for all min-entropies and a new pseudo-random generator, in: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001, pp. 648-657
26. C. Umans, Pseudo-random generators for all hardnesses, in: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 2002, pp. 627-634
27. M. Sudan, L. Trevisan, S. Vadhan, Pseudorandom generators without the XOR lemma, in: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 537-546
28. Sudan M. Decoding of Reed Solomon codes beyond the error-correction bound. J. Complexity 13 (1997) 180-193
29. Guruswami V., Hastad J., Sudan M., and Zuckerman D. Combinatorial bounds for list decoding. IEEE Trans. Inform. Theory 48 (2002) 1021-1034
30. Naor J., and Naor M. Small-bias probability spaces: Efficient constructions and applications. SIAM J. Comput. 22 4 (1993) 838-856
31. Alon N., Goldreich O., Håstad J., and Peralta R. Simple constructions of almost k-wise independent random variables. Random Structures Algorithms 3 3 (1992) 289-303
32. Santha M., and Vazirani U.V. Generating quasi-random sequences from semi-random sources. J. Comput. System Sci. 33 (1986) 75-87
33. Chor B., and Goldreich O. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput. 17 2 (1988) 230-261
34. R. Raz, O. Reingold, S. Vadhan, Extracting all the randomness and reducing the error in Trevisan's extractors, in: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 149-158