Extracting all the Randomness and Reducing the Error in Trevisan's Extractors

• Published in: Journal of computer and system sciences Vol. 65; no. 1; pp. 97 - 128
• Main Authors: Raz, Ran, Reingold, Omer, Vadhan, Salil
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 01.08.2002
• Subjects: combinatorial designs; expander graphs; extractors; probabilistic method; pseudorandom generators; extractors; pseudorandom generators; expander graphs; probabilistic method; combinatorial designs

We give explicit constructions of extractors which work for a source of any min-entropy on strings of length n. These extractors can extract any constant fraction of the min-entropy using O(log 2 n) additional random bits, and can extract all the min-entropy using O(log 3 n) additional random bits....