Name
Abstract | ||
|---|---|---|
Abstract We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, each of which have min-entropy n,for an arbitrarily small constant γ > 0. Our extractor is obtained by composing seeded extractors in simple ways. We introduce a new technique to condense independent somewhere-random sources which looks like a useful way to manipulate independent sources. Our techniques are different from those used in recent work [BIW04, BKS,N) . Keywords: Extractor, Independent Sources, Ramsey Graphs |
Year | Venue | Field |
|---|---|---|
2005 | Electronic Colloquium on Computational Complexity (ECCC) | Discrete mathematics,Combinatorics,Polynomial,Min entropy,Mathematics |
DocType | Issue | Citations |
Journal | 106 | 1 |
PageRank | References | Authors |
0.34 | 20 | 1 |