Deterministic extractors for affine sources over large fields

Combinatorica

Volumn 28, Issue 4, 2008, Pages 415-440

  Gabizon, Ariel ^a   Raz, Ran ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 58549103289     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-008-2259-3     Document Type: Article

References (37)

1. N. Alon: Tools from higher algebra, in: R. L. Graham, M. Grötschel and L. Lovász (eds.), Handbook of Combinatorics, Elsevier and The MIT Press, volume 2, pp. 1749-1783, 1995.
2. N. Alon O. Goldreich J. Håstad R. Peralta 1990 Simple constructions of almost k-wise independent random variables Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science II 544 553
3. B. Barak, R. Impagliazzo and A. Wigderson: Extracting randomness from few independent sources, in Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 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 (Baltimore, MD, USA), pp. 1-10, 2005.
5. M. Blum: Independent unbiased coin flips from a correlated biased source: a finite state Markov chain. in Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, pages 425-433, 1984.
6. J. Bourgain 2007 On the construction of affine extractors Geometric and Functional Analysis 17 1 33 57
7. B. Chor O. Goldreich 1988 Unbiased bits from sources of weak randomness and probabilistic communication complexity SIAM Journal on Computing 17 2 230 261
8. B. Chor, O. Goldreich, J. Håstad, J. Friedman, S. Rudich and R. Smolensky: The bit extraction problem or t-resilient functions, in Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, 1985.
9. A. Cohen and A. Wigderson: Dispersers, deterministic amplification, and weak random sources, in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, 1989.
10. Y. Dodis, A. Elbaz, R. Oliveira and R. Raz: Improved randomness extraction from two independent sources, in RANDOM: International Workshop on Randomization and Approximation Techniques in Computer Science. LNCS, 2004.
11. A. Elbaz: Improved constructions for extracting quasi-random bits from sources of weak randomness, MSc Thesis, Weizmann Institute, 2003.
12. A. Gabizon R. Raz R. Shaltiel 2006 Deterministic extractors for bit-fixing sources by obtaining an independent seed SIAM Journal on Computing 36 4 1072 1094
13. R. L. Graham J. H. Spencer 1971 A constructive solution to a tournament problem Canad. Math. Bull. 14 45 48
14. A. Hales R. Jewett 1963 Regularity and positional games Trans. Amer. Math. Soc. 106 222 229
15. J. Kamp and D. Zuckerman: Deterministic extractors for bit-fixing sources and exposure-resilient cryptography, in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003.
16. M. Naor, A. Nussboim and E. Tromer: Efficiently constructible huge graphs that preserve first order properties of random graphs, in TCC, pages 66-85, 2005.
17. N. Nisan A. Ta-Shma 1999 Extracting randomness: A survey and new constructions Journal of Computer and System Sciences 58 1 148 173
18. N. Nisan D. Zuckerman 1996 Randomness is linear in space Journal of Computer and System Sciences 52 1 43 52
19. N. Nisan: Extracting randomness: How and why: A survey, in Proceedings of the 11th Annual IEEE Conference on Computational Complexity, pages 44-58, 1996.
20. R. Raz: Extractors with weak random seeds, in: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (Baltimore, MD, USA), pp. 11-20, 2005.
21. R. Raz O. Reingold S. Vadhan 2002 Extracting all the randomness and reducing the error in trevisan's extractors Journal of Computer and System Sciences 65 1 97 128
22. M. Santha U. V. Vazirani 1986 Generating quasi-random sequences from semi-random sources Journal of Computer and System Sciences 33 75 87
23. W. M. Schmidt: Equations over Finite Fields: An Elementary Approach, Lecture Notes in Mathematics, volume 536, Springer-Verlag, 1976.
24. R. Shaltiel 2002 Recent developments in explicit constructions of extractors Bulletin of the EATCS 77 67 95
25. R. Shaltiel: How to get more mileage from randomness extractors, in IEEE Conference on Computational Complexity, pages 46-60, 2006.
26. R. Shaltiel Ch. Umans 2005 Simple extractors for all min-entropies and a new pseudorandom generator J. ACM 52 2 172 216
27. A. Ta-Shma D. Zuckerman S. Safra 2006 Extractors from reed-muller codes Journal of Computer and System Sciences 72 5 786 812
28. L. Trevisan: Construction of extractors using pseudorandom generators, in Proceedings of the 31st ACM Symposium on Theory of Computing, 1999.
29. L. Trevisan and S. Vadhan: Extracting randomness from samplable distributions, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000.
30. S. Vadhan: Randomness extractors and their many guises, in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 9-12, 2002.
31. U. Vazirani: Efficient considerations in using semi-random sources, in Proceedings of the 19th Annual ACM Symposium on the Theory of Computing, 1987.
32. U. Vazirani 1987 Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources Combinatorica 7 4 375 392
33. U. Vazirani and V. Vazirani: Random polynomial time is equal to semi-random polynomial time, Technical Report TR88-959, Cornell University, Computer Science Department, December 1988.
34. J. VON Neumann 1951 Various techniques used in connection with random digits Applied Math Series 12 36 38
35. A. Weil 1948 On some exponential sums Proc. Nat. Acad. Sci. USA 34 204 207
36. D. Zuckerman: General weak random sources, in Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pages 534-543, 1990.
37. D. Zuckerman 1996 Simulating BPP using a general weak random source Algorithmica 16 4/5 367 391