Rate distortion when side information may be absent
IEEE Transactions on Information Theory
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Topics in Multi-User Information Theory
Foundations and Trends in Communications and Information Theory
On successive refinement for the Wyner-Ziv problem
IEEE Transactions on Information Theory
Source Coding With Limited-Look-Ahead Side Information at the Decoder
IEEE Transactions on Information Theory
On Successive Refinement With Causal Side Information at the Decoders
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Single-letter characterisations of the admissible rate regions of the Gu-Effros two-hop network and the Gray-Wyner network with side-information are open problems. We show that both problems permit single-letter solutions under the assumption of causal side-information. In particular, the special structure of the causal side-information decoder allows one to match converse theorems to known coding theorems using standard information-theoretic tools. This observation complements similar results by Maor and Merhav for the Heegard-Berger problem and the successive-refinement problem with side-information, and suggests that more general results for causal side-information networks may be possible.