Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > TWO-SOURCE EXTRACTOR:
Reports tagged with two-source extractor:
TR15-119 | 23rd July 2015
Eshan Chattopadhyay, David Zuckerman

Explicit Two-Source Extractors and Resilient Functions

Revisions: 5

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 [B2], required each source to have min-entropy $.499n$.

A key ... more >>>




ISSN 1433-8092 | Imprint