|COMPUTER SCIENCE/DISCRETE MATH, I|
|Topic:||Randomness Extractors for a Constant Number Independent Sources of Polynomial Min-Entropy|
|Affiliation:||University of Texas, Austin|
|Date:||Monday, October 10|
|Time/Room:||11:15am - 12:15pm/S-101|
We construct an extractor that can extract from a constant number of independent sources of length $n$, each of which have min-entropy $n^\gamma$ for an arbitrarily small constant $\gamma > 0$. Our constructions are different from recent extractor constructions for this problem in the sense that they do not rely on any results from additive number theory. They are obtained by composing previous constructions of strong seeded extractors in simple ways.