A 2-Source Almost-Extractor for Linear Entropy

Authors:
Anup Rao
Affiliations:
School of Mathematics, Institute for Advanced Study, ,
Venue:
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Year:
2008

Citing 11
Cited 4

Generating quasi-random sequences from semi-random sources

Journal of Computer and System Sciences
Unbiased bits from sources of weak randomness and probabilistic communication complexity

SIAM Journal on Computing - Special issue on cryptography
Randomness is linear in space

Journal of Computer and System Sciences
Extractors: optimal up to constant factors

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Extractors with weak random seeds

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Extractors for a constant number of polynomially small min-entropy independent sources

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
How to Get More Mileage from Randomness Extractors

CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes

CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity

On Generating Independent Random Strings

CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
SIGACT news complexity theory column 68

ACM SIGACT News
Kolmogorov Complexity in Randomness Extraction

ACM Transactions on Computation Theory (TOCT)
Extractors and Lower Bounds for Locally Samplable Sources

ACM Transactions on Computation Theory (TOCT)

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 , where here mis linear in n.