The Common Information of N Dependent Random Variables

Abstract

This paper generalizes Wyner's definition of common information of a pair of random variables to that of $N$ random variables. We prove coding theorems that show the same operational meanings for the common information of two random variables generalize to that of $N$ random variables. As a byproduct of our proof, we show that the Gray-Wyner source coding network can be generalized to $N$ source squences with $N$ decoders. We also establish a monotone property of Wyner's common information which is in contrast to other notions of the common information, specifically Shannon's mutual information and Gács and Körner's common randomness. Examples about the computation of Wyner's common information of $N$ random variables are also given.

8 pages, 4 figures,presented at the Forty-Eighth Annual Allerton Conference on Communication, Control, and Computing, September 29 - October 1, 2010, Monticello, IL, USA

References in corpus (1)

• When is a Function Securely Computable?

Cited by in corpus (4)

• Wyner's Common Information: Generalizations and A New Lossy Source Coding Interpretation
• Multi-User Privacy: The Gray-Wyner System and Generalized Common Information
• Some new insights into information decomposition in complex systems based on common information
• Multipartite Monotones for Secure Sampling by Public Discussion From Noisy Correlations