Communication for Generating Correlation: A Unifying Survey

DOI10.1109/TIT.2019.2946364zbMATH Open1433.94107arXiv1904.09563OpenAlexW2979871288MaRDI QIDQ5211580FDOQ5211580

Authors: Himanshu Tyagi, Shun Watanabe, Madhu Sudan 

Publication date: 28 January 2020

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

Abstract: The task of manipulating correlated random variables in a distributed setting has received attention in the fields of both Information Theory and Computer Science. Often shared correlations can be converted, using a little amount of communication, into perfectly shared uniform random variables. Such perfect shared randomness, in turn, enables the solutions of many tasks. Even the reverse conversion of perfectly shared uniform randomness into variables with a desired form of correlation turns out to be insightful and technically useful. In this survey article, we describe progress-to-date on such problems and lay out pertinent measures, achievability results, limits of performance, and point to new directions.

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

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Measures of information, entropy (94A17) Authentication, digital signatures and secret sharing (94A62)

Cited In (5)

• Title not available (Why is that?)
• One-message secure reductions: on the cost of converting correlations
• Secure non-interactive reduction and spectral analysis of correlations
• Common Information, Noise Stability, and Their Extensions
• Secure non-interactive reducibility is decidable

This page was built for publication: Communication for Generating Correlation: A Unifying Survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211580)