Chain independence and common information

Konstantin Makarychev*, Yury Makarychev

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

We present a new proof of a celebrated result of Gcs and Krner that the common information is far less than the mutual information. Consider two sequences α{1},....,α n and β{1},...., β n of random variables, where pairs (α{1},β{1}),\ ldots, (α{n},β{n}) are independent and identically distributed. Gcs and Krner proved that it is not possible to extract common information from these two sequences unless the joint distribution matrix of random variables (α{i},β{i}) is a block matrix.

Original languageEnglish (US)
Article number6200860
Pages (from-to)5279-5286
Number of pages8
JournalIEEE Transactions on Information Theory
Volume58
Issue number8
DOIs
StatePublished - Jul 23 2012

Keywords

  • Chain independent random variables
  • common information
  • rate region

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'Chain independence and common information'. Together they form a unique fingerprint.

Cite this