Rate-Distortion with Side-Information at Many Decoders

Details Rate-Distortion with Side-Information at Many Decoders Rate-Distortion with Side-Information at Many Decoders

2009-01-13

arxiv.org/abs/0901.1705v2

Computer Science

Information Theory

36 pages. Submitted to IEEE Transactions on Information Theory. In proc. ISIT 2010.

Scientific paper

We present a new inner bound for the rate region of the $t$-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.

Affiliated with

Also associated with

No associations

Rating

Rate-Distortion with Side-Information at Many Decoders does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Rate-Distortion with Side-Information at Many Decoders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rate-Distortion with Side-Information at Many Decoders will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-71472