Explicit Two-Source Extractors and Resilient Functions

STOC '16: Symposium on Theory of Computing Cambridge MA USA June, 2016, pp. 670-683, 2016.

Cited by: 117|Bibtex|Views101|Links
EI
Keywords:
Randomness ExtractorPseudorandomnessTwo-Source ExtractorResilient FunctionRamsey graph

Abstract:

We explicitly construct an extractor for two independent sources on n bits, each with polylogarithmic min-entropy. Our extractor outputs one bit and has polynomially small error. The best previous extractor, by Bourgain, required each source to have min-entropy .499n. A key ingredient in our construction is an explicit construction of...More

Code:

Data:

Your rating :
0

 

Best Paper
Best Paper of STOC, 2016
Tags
Comments