Reconstructive dispersers and hitting set generators

Lecture Notes in Computer Science

Volumn 3624, Issue , 2005, Pages 460-471

  Umans, Christopher ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMBINATORIAL MATHEMATICS; DISPENSERS; ERROR CORRECTION; PARAMETER ESTIMATION;

COMBINATORIAL DESIGNS; DISPENSER CONSTRUCTION; ERROR-CORRECTING CODES; HITTING SET GENERATORS (HSG);

ELECTRIC GENERATORS;

EID: 26944474386     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538462_39     Document Type: Conference Paper

References (16)

1. Trevisan, L.: Extractors and pseudorandom generators. Journal of the ACM 48 (2002) 860-879
2. Sudan, M., Trevisan, L., Vadhan, S.: Pseudorandom generators without the XOR lemma. JCSS: Journal of Computer and System Sciences 62 (2001)
3. Ta-Shma, A., Zuckerman, D., Safra, S.: Extractors from Reed-Muller codes. In: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science. (2001)
4. Shaltiel, R., Umans, C.: 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)
5. Impagliazzo, R., Shaltiel, R., Wigderson, A.: Near-optimal conversion of hardness into pseudo-randomness. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science. (1999) 181-190
6. Impagliazzo, R., Shaltiel, R., Wigderson, A.: Extractors and pseudo-randomn generators with optimal seed-length. In: Proceedings of the Thirty-second Annual ACM Symposium on the Theory of Computing. (2000)
7. Ta-Shma, A., Umans, C., Zuckerman, D.: Loss-less condensers, unbalanced expanders, and extractors. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing. (2001) 143-152
8. Umans, C.: Pseudo-random generators for all hardnesses. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing. (2002) 627-634
9. Nisan, N., Wigderson, A.: Hardness vs randomness. Journal of Computer and System Sciences 40 (1994) 149-167
10. Impagliazzo, R., Wigderson, A.: P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing. (1997) 220-229
11. Ta-Shma, A., Zuckerman, D.: Extractor codes. IEEE Transactions on Information Theory 50 (2004) 3015-3025
12. Guruswami, V.: Better extractors for better codes? In: STOC. (2004) 436-444
13. Ta-Shma, A.: Storing information with extractors. Inf. Process. Lett. 83 (2002) 267-274
14. Buhrman, H., Lee, T., van Melkebeek, D.: Language compression and pseudo-random generators. In: IEEE Conference on Computational Complexity. (2004) 15-28
15. Gutfreund, D., Shaltiel, R., Ta-Shma, A.: Uniform hardness vs. randomness trade-offs for Arthur-Merlin games. In: 18th Annual IEEE Conference on Computational Complexity. (2003)
16. Miltersen, P.B., Vinodchandran, N.V.: Derandomizing Arthur-Merlin games using hitting sets. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science. (1999) 71-80