New independent source extractors with exponential improvement

DOI10.1145/2488608.2488708zbMath1293.68059OpenAlexW2127367297MaRDI QIDQ5495849

Xin Li

Publication date: 7 August 2014

Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2488608.2488708

zbMATH Keywords

randomnessextractorindependent source

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Related Items

Non-malleable codes for bounded parallel-time tampering ⋮ An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy ⋮ Unnamed Item ⋮ Extractor Lower Bounds, Revisited ⋮ Unnamed Item ⋮ How to extract useful randomness from unreliable sources ⋮ Multi-source non-malleable extractors and applications ⋮ Explicit two-source extractors and resilient functions