Communication for Generating Correlation: A Unifying Survey
From MaRDI portal
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.
Cited in
(10)- Secure non-interactive reduction and spectral analysis of correlations
- Communication complexity of the secret key agreement in algorithmic information theory
- Common Information, Noise Stability, and Their Extensions
- Secure non-interactive reducibility is decidable
- One-message secure reductions: on the cost of converting correlations
- Spectral approach to the communication complexity of multi-party key agreement
- Parallelize single-site dynamics up to Dobrushin criterion
- Optimal signal processing for common randomness generation over MIMO Gaussian channels with applications in identification
- Communication complexity of the secret key agreement in algorithmic information theory
- Quantum broadcast channel simulation via multipartite convex splitting
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)