Extractors for a Constant Number of Independent Sources with Polylogarithmic Min-Entropy

@article{Li2013ExtractorsFA,
  title={Extractors for a Constant Number of Independent Sources with Polylogarithmic Min-Entropy},
  author={Xin Li},
  journal={2013 IEEE 54th Annual Symposium on Foundations of Computer Science},
  year={2013},
  pages={100-109}
}
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 independent sources, previously the best known extractors require the min-entropy to be at least nδ for any constant δ > 0 [1], [2], [3]. For sources on n bits with min… CONTINUE READING
Highly Cited
This paper has 41 citations. REVIEW CITATIONS

2 Figures & Tables

Topics

Statistics

01020201620172018
Citations per Year

Citation Velocity: 9

Averaging 9 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.