Explicit two-source extractors and resilient functions

ANNALS OF MATHEMATICS, pp. 653-705, 2019.

Cited by: 0|Bibtex|Views0|Links
Keywords:
Ramsey graphsRandomness extractors

Abstract:

We explicitly construct an extractor for two independent sources on n bits, each with min-entropy at least log(C) n for a large enough constant C. Our extractor outputs one bit and has error n(-Omega(1)). The best previous extractor, by Bourgain, required each source to have min-entropy .499n. A key ingredient in our construction is an ex...More

Code:

Data:

Your rating :
0

 

Tags
Comments