Highly Influenced

# Extractors for Affine Sources with Polylogarithmic Entropy

@article{Li2015ExtractorsFA, title={Extractors for Affine Sources with Polylogarithmic Entropy}, author={Xin Li}, journal={Electronic Colloquium on Computational Complexity (ECCC)}, year={2015}, volume={22}, pages={121} }

- Published 2015 in Electronic Colloquium on Computational Complexity

We give the first explicit construction of deterministic extractors for affine sources over F2, with entropy k ≥ log n for some large enough constant C, where n is the length of the source. Previously the best known results are by Bourgain [Bou07], Yehudayoff [Yeh11] and Li [Li11b], which require the affine source to have entropy at least Ω(n/ √ log log n). Our extractor outputs one bit with error n. Our construction is obtained by reducing an affine source to a non-oblivious bit-fixing source… CONTINUE READING