Extended Gray-Wyner system with complementary causal side information

  title={Extended Gray-Wyner system with complementary causal side information},
  author={Cheuk Ting Li and Abbas El Gamal},
  journal={2017 IEEE International Symposium on Information Theory (ISIT)},
  • Cheuk Ting Li, A. Gamal
  • Published 12 January 2017
  • Computer Science
  • 2017 IEEE International Symposium on Information Theory (ISIT)
We establish the rate region of an extended Gray-Wyner system for 2-DMS (X, Y) with two additional decoders having complementary causal side information. This extension is interesting because in addition to the operationally significant extreme points of the Gray-Wyner rate region, which include Wyner's common information, Gåcs-Körner common information and information bottleneck, the rate region for the extended system also includes the Körner graph entropy, the privacy funnel and excess… 

Figures and Tables from this paper

A Game Theoretical Analysis on the Gray-Wyner System and Generalised Common Information
A simple networked control system consisting of 2 groups of users, one sender or Observer named Alice provides a redundancy creating some virtual messages which are in the null of each specific Bob, but not for others, to tackle the possible risk arisen from the common information among Bobs.
An Automated Theorem Proving Framework for Information-Theoretic Results
  • Cheuk Ting Li
  • Computer Science
    2021 IEEE International Symposium on Information Theory (ISIT)
  • 2021
The concept of existential information inequalities is introduced, which provides an axiomatic framework for a wide range of problems in information theory.
Privacy-aware guessing efficiency
It is shown that the map ε → h(P<inf>XY</inf>,ε) is strictly increasing, concave, and piecewise linear, which allows us to derive a closed form expression for h(inf>xY</inf),ε when X and Y are connected via a binary-input binary-output channel.


Extended Gray–Wyner System With Complementary Causal Side Information
It is shown that projections of the mutual information region yield the rate regions for many settings involving a two discrete memoryless source (2-DMS), including lossless source coding with causal side information, distributed channel synthesis, and lossless sources coding with a helper.
A new dual to the Gács-Körner common information defined via the Gray-Wyner system
  • Sudeep Kamath, V. Anantharam
  • Computer Science
    2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2010
A new notion of common information between the random variables is proposed that is dual to the Gács-Körner common information from this viewpoint in a well-defined sense and characterized explicitly in terms of two auxiliary quantities that are asymmetric in nature.
Two lossy source coding problems with causal side-information
  • R. Timo, B. Vellambi
  • Computer Science
    2009 IEEE International Symposium on Information Theory
  • 2009
The special structure of the causal side-information decoder allows one to match converse theorems to known coding theorets using standard information-theoretic tools, and suggests that more general results for causal Side-information networks may be possible.
Distributed Channel Synthesis
  • P. Cuff
  • Computer Science
    IEEE Transactions on Information Theory
  • 2013
This paper characterizes the optimal tradeoff between the amount of common randomness used and the required rate of description and generalizes and strengthens a soft covering lemma, known in the literature for its role in quantifying the resolvability of a channel.
Source Coding With Limited-Look-Ahead Side Information at the Decoder
The results characterize the best achievable rate for the Slepian-Wolf source coding problem with finite side information looka-head, and have some surprising implications.
On successive refinement for the Wyner-Ziv problem
It is demonstrated that a source that is not successively refinable in the ordinary sense may become successivelyRefinement in the presence of SI at the decoders, in the Wyner-Ziv setting.
Strong functional representation lemma and applications to coding theorems
  • Cheuk Ting Li, A. Gamal
  • Computer Science
    2017 IEEE International Symposium on Information Theory (ISIT)
  • 2017
It is shown that for any random variables X and Y, it is possible to represent Y as a function of (X, Z) such that Z is independent of X and log(I(X; Y)+1)+4, which establishes a tighter bound on the rate needed for one-shot exact channel simulation.
Source coding with side information and a converse for degraded broadcast channels
In Section H of the paper, a characterization of the capacity region for degraded broadcast channels (DBC's) is given, which was conjectured by Bergmans and is somewhat sharper than the one obtained by Gallager.
The common information of two dependent random variables
  • A. Wyner
  • Mathematics, Computer Science
    IEEE Trans. Inf. Theory
  • 1975
The main result of the paper is contained in two theorems which show that C(X; Y) is i) the minimum R_0 such that a sequence of independent copies of (X,Y) can be efficiently encoded into three binary streams W_0, W_1,W_2 with rates R-0, R-1,R-2.
Side-Information Scalable Source Coding
Using SI-scalable coding and successive refinement Wyner-Ziv coding as basic building blocks, this work provides a complete characterization of the rate-distortion region for the important quadratic Gaussian source with multiple jointly Gaussian side informations, where the side information quality is not necessarily monotonic along the scalable coding order.