On obtaining pseudorandomness from error-correcting codes

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

Volumn 4337 LNCS, Issue , 2006, Pages 105-116

  Kalyanaraman, Shankar ^a   Umans, Christopher ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RANDOM PROCESSES; REED-SOLOMON CODES; SOFTWARE ENGINEERING; TESTING;

ERROR CORRECTING CODE; HARD FUNCTION; POLYNOMIAL CODES; PREDICTION TESTS; PSEUDORANDOM GENERATORS; PSEUDORANDOMNESS; RANDOM SOURCES; RANDOMNESS EXTRACTORS;

CODES (SYMBOLS);

EID: 34748912354     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11944836_12     Document Type: Conference Paper

References (33)

1. A. E. Andreev, J. L. Baskakov, A. E. F. Clementi, and J. D. P. Rolim. Small random sets for affine spaces and better explicit lower bounds for branching programs. Technical Report TR04-053, ECCC, 1997.
2. N. Alon, O. Goldreich, J. Hastad, and R. Peralta. Simple constructions of almost k-wise independent random variables. Random Struct. Algorithms, (3):289–304, 1992.
3. A. Bogdanov. Pseudorandom generators for low degree polynomials. In Proceedings of STOC, pages 21–30, 2005.
4. Z. Dvir and A. Shpilka. Locally decodable codes with 2 queries and polynomial identitytestingfor depth3circuits. InProceedings of STOC, pages 592–601, 2005.
5. O. Goldreich and D. Zuckerman. Another proof that BPP subseteq PH (and more). Technical Report TR97-045, ECCC, 1997.
6. R. Impagliazzo, N. Nisan, and A. Wigderson. Pseudorandomness for network algorithms. In Proceedings of STOC, pages 356–364, 1994.
7. V. Kabanets and R. Impagliazzo. Derandomizing polynomial identity tests means proving circuit lower bounds. volume 13, pages 1–46, 2004.
8. A. Klivans and D. Spielman. Randomness efficient identity testing of multivariate polynomials. In Proceedings of STOC, pages 216–223, 2001.
9. C.-J. Lu, O. Reingold, S. Vadhan, and A. Wigderson. Extractors: optimal up to constant factors. In Proceedings of STOC, pages 602–611, 2003.
10. D. Lewin and S. Vadhan. Checking polynomial identities over any field: Towards a derandomization? In Proceedings of STOC, pages 438–447, 1998.
11. E. Mossel and C. Umans. On the complexity of approximating the VC dimension. J. Comput. Syst. Sci., 65(4):660–671, 2002.
12. N. Nisan. Pseudorandom generators for space-bounded computation. Combinator-ica, 12:249–461, 1992.
13. N. Nisan. RL ⊆ SC. Computational Complexity, 4(1):1–11, 1994.
14. J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. SICOMP, 22(4):838–856, August 1993.
15. N. Nisan and D. Zuckerman. Randomness is linear in space. J. Comput. Syst. Sci., 52(1):43–52, February 1996.
16. R. Raz and A. Shpilka. Deterministic polynomial identity testing in non-commutative models. In CCC.
17. O. Reingold, R. Shaltiel, and A. Wigderson. Extracting randomness via repeated condensing. In IEEE, editor,FOCS, pages 22–31, 2000.
18. ∗ n+O(1) rounds. J. Comput. Syst. Sci., 63(4):612–626, 2001.
19. R. Shaltiel. Recent developments in explicit constructions of extractors. Bulletin of EATCS, 77:67–95, June 2002. Columns: Computational Complexity.
20. M. Sipser. Expanders, randomness, or time versus space. J. Comput. Syst. Sci., 36(3):379–383, 1988.
21. A. Srinivasan. Low-discrepancy sets for high-dimensional rectangles: a survey. Bulletin of the EATCS, 70:67–76, 2000.
22. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR lemma. J. Comput. Syst. Sci., 62(2):236–266, March 2001.
23. R. Shaltiel and C. Umans. Simple extractors for all min-entropies and a new pseudorandom generator. J. ACM, 52(2):172–216, 2005.
24. 3/2). J. Comput. Syst. Sci., 58(2):376–403, 1999.
25. L. Trevisan. Extractors and pseudorandom generators. J. ACM, 48(4):860–879, July 2001.
26. A. Ta-Shma and D. Zuckerman. Extractor codes. In ACM, editor, Proceedings of STOC, pages 193–199, 2001.
27. A. Ta-Shma, D. Zuckerman, and S. Safra. Extractors from Reed-Muller codes. In Proceedings of FOCS, pages 638–647, 2001.
28. p minimization problems. In Proceedings of FOCS, pages 465–474, 1999.
29. C. Umans. Pseudo-random generators for all hardnesses. J. Comput. Syst. Sci., 67(2):419–440, 2003.
30. A. Wigderson and D. Zuckerman. Expanders that beat the eigenvalue bound: Explicit construction and applications. In Proceedings of STOC, pages 245–251, 1993.
31. A. C. Yao. Theory and applications of trapdoor functions. In Proceedings of the 23rd Symposium on Foundations of Computer Science (FOCS), pages 80–91. IEEE Computer Society Press, 1982.
32. D. Zuckerman. On unapproximable versions of NP -complete problems. SICOMP, 25(6):1293–1304, December 1996.
33. D. Zuckerman. Randomness-optimal oblivious sampling. Random Struct. Algorithms, 11:345–367, 1997.