Rate-Distortion with Side-Information at Many Decoders
arXiv:0901.1705 · doi:10.1109/TIT.2011.2158472
Abstract
We present a new inner bound for the rate region of the -stage successive-refinement problem with side-information. We also present a new upper bound for the rate-distortion function for lossy-source coding with multiple decoders and side-information. Characterising this rate-distortion function is a long-standing open problem, and it is widely believed that the tightest upper bound is provided by Theorem 2 of Heegard and Berger's paper "Rate Distortion when Side Information may be Absent", \emph{IEEE Trans. Inform. Theory}, 1985. We give a counterexample to Heegard and Berger's result.
36 pages. Submitted to IEEE Transactions on Information Theory. In proc. ISIT 2010.
References in corpus (1)
Cited by in corpus (7)
- Secure Multiterminal Source Coding with Side Information at the Eavesdropper
- Information-Theoretic Caching: Sequential Coding for Computing
- Rate-Distortion Region of a Gray-Wyner Model with Side Information
- Lossy Broadcasting in Two-Way Relay Networks with Common Reconstructions
- Source Coding Problems with Conditionally Less Noisy Side Information
- Universal Wyner-Ziv Coding for Distortion Constrained General Side-Information
- The Three-Terminal Interactive Lossy Source Coding Problem