Extractors for a Constant Number of Polynomial Min-Entropy Independent Sources
نویسنده
چکیده
We consider the problem of bit 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 minentropy n for an arbitrarily small constant γ > 0. Our constructions are different from recent extractor constructions [BIW04, BKS05, Raz05, Bou05] 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. 1 Electronic Colloquium on Computational Complexity, Report No. 106 (2005)
منابع مشابه
Quantum-Proof Extractors: Optimal up to Constant Factors
We give the first construction of a family of quantum-proof extractors that has optimal seed length dependence O(log(n/ǫ)) on the input length n and error ǫ. Our extractors support any min-entropy k = Ω(log n+ log(1/ǫ)) and extract m = (1− α)k bits that are ǫ-close to uniform, for any desired constant α > 0. Previous constructions had a quadratically worse seed length or were restricted to very...
متن کاملLow-error two-source extractors for polynomial min-entropy
The aim of this paper was to present a new two-source extractor for min-entropy nα for some α < 1 having exponentially-small error. Say we are given two independent sources X and Y . The technique was to condense Y using a somewhere-random condenser to a somewhere-random source with t rows, where one of the rows has a high min-entropy rate. Then, in order to break correlations between the rows,...
متن کاملNew Extractors for Interleaved Sources
We study how to extract randomness from a C-interleaved source, that is, a source comprised of C independent sources whose bits or symbols are interleaved. We describe a simple approach for constructing such extractors that yields: • For some δ > 0, c > 0, explicit extractors for 2-interleaved sources on {0, 1} when one source has min-entropy at least (1 − δ)n and the other has min-entropy at l...
متن کاملDeterministic Extraction from Weak Random Sources - Preamble
Preface Roughly speaking, a deterministic extractor is a function that 'extracts' almost perfect random bits from a 'weak random source'-a distribution that contains some entropy but is far from being truly random. In this book we explicitly construct deterministic extractors and related objects for various types of sources. A basic theme in this book is a methodology of recycling randomness th...
متن کامل2-Source Dispersers for n Entropy, and Ramsey Graphs Beating the Frankl-Wilson Construction
The main result of this paper is an explicit disperser for two independent sources on n bits, each of min-entropy k = 2 1−α0 , for some small absolute constant α0 > 0). Put differently, setting N = 2 and K = 2, we construct an explicit N ×N Boolean matrix for which no K ×K sub-matrix is monochromatic. Viewed as the adjacency matrix of a bipartite graph, this gives an explicit construction of a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره شماره
صفحات -
تاریخ انتشار 2005