Affine dispersers from subspace polynomials

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 65-74

  Ben Sasson, Eli ^a   Kopparty, Swastik ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algorithms; Theory

Indexed keywords

AFFINE SPACE; EXPLICIT CONSTRUCTIONS; FINITE FIELDS; SUBLINEAR; SUM PRODUCT; THEORY;

TOPOLOGY;

COMPUTATION THEORY;

EID: 70350588635     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536426     Document Type: Conference Paper

References (23)

1. B. Barak, R. Impagliazzo, and A. Wigderson. Extracting randomness using few independent sources. In FOCS, pages 384-393, Washington, DC, USA, 2004. IEEE Computer Society.
2. B. Barak, G. Kindler, R. Shaltiel, B. Sudakov, and A. Wigderson. Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors. In STOC, pages 1-10, 2005.
3. B. Barak, A. Rao, R. Shaltiel, and A. Wigderson. 2-source dispersers for sub-polynomial entropy and ramsey graphs beating the frankl-wilson construction. In STOC, pages 671-680, New York, NY, USA, 2006. ACM.
4. E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, and S. Vadhan. Robust PCPs of proximity, shorter PCPs and applications to coding. In ACM, editor, STOC, pages 1-10, 2004.
5. E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, and S. P. Vadhan. Short PCPs veriable in polylogarithmic time. In IEEE Conference on Computational Complexity, pages 120-134, 2005.
6. E. Ben-Sasson, S. Hoory, E. Rozenman, and S. Vadhan. Extractors for affine sources, unpublished manuscript. 2001.
7. E. Ben-Sasson, S. Kopparty, and J. Radhakrishnan. Subspace polynomials and list decoding of reed-solomon codes. In FOCS, pages 207-216, 2006.
8. E. Ben-Sasson and M. Sudan. Simple PCPs with poly-log rate and query complexity. In STOC, pages 266-275, New York, NY, USA, 2005. ACM Press.
9. E. R. Berlekamp. Algebraic Coding Theory. Mc Graw-Hill, revised 1984 edition, 1968.
10. J. Bourgain. On the construction of affine extractors. Geometric and Functional Analysis, 17(1):33-57, 2007.
11. J. Bourgain, A. A. Glibichuk, and S. V. Konyagin. Estimates for the number of sums and products and for exponential sums in fields of prime order. J. London Math. Soc. (2), 73(2):380-398, 2006.
12. J. Bourgain, N. Katz, and T. Tao. A sum-product estimate in finite fields, and applications. Geom. Funct. Anal., 14(1):27-57, 2004.
13. B. Chor, O. Goldreich, J. Håstad, J. Friedman, S. Rudich, and R. Smolensky. The bit extraction problem of t-resilient functions (preliminary version). In FOCS, pages 396-407. IEEE, 1985.
14. Gabizon, Raz, and Shaltiel. Deterministic extractors for bit- xing sources by obtaining an independent seed. SICOMP: SIAM Journal on Computing, 36, 2006.
15. A. Gabizon and R. Raz. Deterministic extractors for affine sources over large fields. In FOCS, pages 407-418, Washington, DC, USA, 2005. IEEE Computer Society.
16. J. Kamp, A. Rao, S. P. Vadhan, and D. Zuckerman. Deterministic extractors for small-space sources. In STOC, pages 691-700, 2006.
17. J. Kamp and D. Zuckerman. Deterministic extractors for bit- xing sources and exposure-resilient cryptography. SIAM J. Comput., 36(5):1231-1247, 2007.
18. R. Lidl and H. Niederreiter. Finite fields, volume 20 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, second edition, 1997.
19. O. Ore. On a special class of polynomials. Trans. Amer. Math. Soc., 35(3):559-584, 1933.
20. O. Ore. Contributions to the theory of finite fields. Trans. Amer. Math. Soc., 36(2):243-274, 1934.
21. R. Shaltiel. Recent developments in explicit constructions of extractors. Bulletin of the EATCS, 77:67-95, 2002.
22. L. Trevisan and S. P. Vadhan. Extracting randomness from samplable distributions. In FOCS, pages 32-42, 2000.
23. D. Zuckerman. Linear degree extractors and the inapproximability of max clique and chromatic number. In STOC, pages 681-690, New York, NY, USA, 2006. ACM.