Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Information Theory (ISIT)

Common Information of Two Correlated Random Variables

H. Yamamoto

Published Aug 24, 2005• 0 citations
Publisher

Abstract

Two kinds of common information are defined for two correlated random variables, and they are represented by single letter characterizations.
DOI
10.1109/isit.1993.748384

Related papers

A Secret Common Information Duality for Tripartite Noisy Correlations

Pradeep Kr. Banerjee

arXiv:1502.05775•Communications in computer and information science•Jan 1, 2015•1 citation

Exact common information

Gowtham Ramani Kumar, Cheuk Ting Li, Abbas El Gamal

This paper introduces the notion of exact common information, which is the minimum description length of the common randomness needed for the exact distributed generation of two correlated random variables (X, Y). We introduce the quantity G(X; Y) = minX→W→YH(W) as a natural bound on the exact common information and study its properties and computation. We then introduce the exact common information rate, which is the minimum description rate of the common randomness for the exact generation of a 2-DMS (X, Y). We give a multiletter characterization for it as the limit Ḡ(X; Y) = limn→∞(1/n)G(Xn; Yn). While in general Ḡ(X; Y) is greater than or equal to the Wyner common information, we show that they are equal for the Symmetric Binary Erasure Source. We do not know, however, if the exact common information rate has a single letter characterization in general.

arXiv:1402.0062•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2014•64 citations

The efficiency of common randomness generation

Lei Zhao, Yeow-Kiang Chia

The Hirschfeld-Gebelein-Renyi maximal correlation (HGR correlation) as a measure of commonness between a pair of random variables is justified via the initial efficiency of common randomness generation in the Ahlswede-Csiszar setting [1]. When action can be taken to influence the side information, we obtain a single letter expression of the common randomness capacity. Initial efficiency and ending efficiency are also characterized in the action setting.

Allerton Conference on Communication, Control, and Computing•Sep 1, 2011•11 citations

Information Entropy of Discrete Quasi-random Variables and Its Properties

Yang Yang, Chao Wang, Ming-Hu Ha

Advances in intelligent and soft computing•Jan 1, 2012•1 citation

Exact Common Information and Exact Channel Synthesis for Correlated Discrete Sources

Lei Yu

In this paper, we provide a single-letter characterization of the exact common information for a pair of correlated discrete sources, as well as a single-letter characterization of the admissible region for the shared randomness rate and the communication rate in exact channel synthesis.

arXiv:2609.24120•Sep 21, 2026•0 citations

A MATHEMATICAL TREATMENT OF JOINT AND CONDITIONAL PROBABILITY

Masanori Asano, Masanori Ohya, Yoshiharu Tanaka +3 more

QP-PQ, quantum probability and white noise analysis•Mar 1, 2013•0 citations
This paper introduces the notion of exact common information, which is the minimum description length of the common randomness needed for the exact distributed generation of two correlated random variables (X, Y). We introduce the quantity G(X; Y) = minX→W→YH(W) as a natural bound on the exact common information and study its properties and computation. We then introduce the exact common information rate, which is the minimum description rate of the common randomness for the exact generation of a 2-DMS (X, Y). We give a multiletter characterization for it as the limit Ḡ(X; Y) = limn→∞(1/n)G(Xn; Yn). While in general Ḡ(X; Y) is greater than or equal to the Wyner common information, we show that they are equal for the Symmetric Binary Erasure Source. We do not know, however, if the exact common information rate has a single letter characterization in general.