An Exposition of Bourgain's 2-Source Extractor
نویسنده
چکیده
Abstract A construction of Bourgain [Bou05] gave the first 2-source extractor to break the min-entropy rate 1/2 barrier. In this note, we write an exposition of his result, giving a high level way to view his extractor construction. We also include a proof of a generalization of Vazirani’s XOR lemma that seems interesting in its own right, and an argument (due to Boaz Barak) that shows that any two source extractor with sufficiently small error must be strong.
منابع مشابه
J un 1 99 1 A simple proof of a theorem of
We give a simple proof of Bourgain's disc algebra version of Grothendieck's theorem, i.e. that every operator on the disc algebra with values in L 1 or L 2 is 2-absolutely summing and hence extends to an operator defined on the whole of C. This implies Bourgain's result that L 1 /H 1 is of cotype 2. We also prove more generally that L r /H r is of cotype 2 for 0 < r < 1.
متن کاملA 2-Source Almost-Extractor for Linear Entropy
We give an explicit construction of a function that is almost a 2-source extractor for linear entropy, it is a condenser where the output has almost full entropy. Given 2 sources with entropy δn, the output of the condenser is a distribution on m-bit strings that is ǫ-close to having min-entropy m− poly(log(1/ǫ), 1/δ), where here m is linear in n.
متن کاملExtractors for Three Uneven-Length Sources
We construct an efficient 3-source extractor that requires one of the sources to be significantly shorter than the min-entropy of the other two sources. Our extractors work even when the longer, n-bit sources have min-entropy n and the shorter source has min-entropy log n. Previous constructions for independent sources with min-entropy n required Θ(1/γ) sources [Rao06]. Our construction relies ...
متن کاملImproved Randomness Extraction from Two Independent Sources
Given two independent weak random sources X,Y , with the same length l and min-entropies bX , bY whose sum is greater than l + Ω(polylog(l/ε)), we construct a deterministic two-source extractor (aka “blender”) that extracts max(bX , bY ) + (bX + bY − l − 4 log(1/ε)) bits which are ε-close to uniform. In contrast, best previously published construction [4] extracted at most 1 2 (bX + bY − l− 2 l...
متن کاملBetter short-seed quantum-proof extractors
We construct a strong extractor against quantum storage that works for every min-entropy k, has logarithmic seed length, and outputs Ω(k) bits, provided that the quantum adversary has at most βk qubits of memory, for any β < 1 2 . The construction works by first condensing the source (with minimal entropy-loss) and then applying an extractor that works well against quantum adversaries when the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 14 شماره
صفحات -
تاریخ انتشار 2007