We study the problem of constructing explicit extractors for independent general weak random sources. For weak sources on n bits with min-entropy k, perviously the best known extractor needs to use at least \frac{\log n}{\log k} independent sources \cite{Rao06, BarakRSW06}. In this paper we give a new extractor that only ... more >>>

We study the problem of constructing explicit extractors for independent general weak random sources. Given weak sources on n bits, the probabilistic method shows that there exists a deterministic extractor for two independent sources with min-entropy as small as \log n+O(1). However, even to extract from a constant number of ... more >>>