Simulating independence

Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson
2005 Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05  
A distribution X over binary strings of length n has minentropy k if every string has probability at most 2 −k in X. 1 We say that X is a δ-source if its rate k/n is at least δ. We give the following new explicit constructions (namely, poly(n)-time computable functions) of deterministic extractors, dispersers and related objects. All work for any fixed rate δ > 0. No previous explicit construction was known for either of these, for any δ < 1/2. The first two constitute major progress to very long-standing open problems.
doi:10.1145/1060590.1060592 dblp:conf/stoc/BarakKSSW05 fatcat:6lziswiaf5fpbd33eydzexvtwi