On Extracting Common Random Bits From Correlated Sources

DOI10.1109/TIT.2011.2134067zbMath1365.94010arXiv1007.2315OpenAlexW2098392316MaRDI QIDQ5272265

Andrej Bogdanov, Elchanan Mossel

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.2315

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Communication theory (94A05)

Related Items

Communication with contextual uncertainty, Secure non-interactive simulation: feasibility and rate, Secure non-interactive simulation from arbitrary joint distributions, One-message secure reductions: on the cost of converting correlations, Dimension Reduction for Polynomials over Gaussian Space and Applications, Common Information, Noise Stability, and Their Extensions