Heegard-Berger and Cascade Source Coding Problems with Common Reconstruction Constraints
Behzad Ahmadi, Ravi Tandon, Osvaldo Simeone, H. Vincent Poor

TL;DR
This paper derives the rate-distortion functions and regions for Heegard-Berger and cascade source coding problems with common reconstruction constraints, focusing on degraded side information scenarios and providing explicit solutions for Gaussian and binary sources.
Contribution
It provides the first explicit rate-distortion functions for these problems with CR constraints under degraded side information, including new bounds and special case solutions.
Findings
Explicit rate-distortion functions for Gaussian sources with quadratic distortion.
Rate-distortion regions characterized for binary sources with erasure and Hamming metrics.
Bounds shown to coincide in key example cases.
Abstract
For the HB problem with the CR constraint, the rate-distortion function is derived under the assumption that the side information sequences are (stochastically) degraded. The rate-distortion function is also calculated explicitly for three examples, namely Gaussian source and side information with quadratic distortion metric, and binary source and side information with erasure and Hamming distortion metrics. The rate-distortion function is then characterized for the HB problem with cooperating decoders and (physically) degraded side information. For the cascade problem with the CR constraint, the rate-distortion region is obtained under the assumption that side information at the final node is physically degraded with respect to that at the intermediate node. For the latter two cases, it is worth emphasizing that the corresponding problem without the CR constraint is still open. Outer…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
