An Outer Bound for the Multi-Terminal Rate-Distortion Region

Details An Outer Bound for the Multi-Terminal Rate-Distortion Region An Outer Bound for the Multi-Terminal Rate-Distortion Region

2006-05-29

arxiv.org/abs/cs/0605129v1

Computer Science

Information Theory

5 pages, 1 figure, to appear in Proc. IEEE International Symp. on Information Theory (ISIT) 2006

Scientific paper

The multi-terminal rate-distortion problem has been studied extensively. Notably, among these, Tung and Housewright have provided the best known inner and outer bounds for the rate region under certain distortion constraints. In this paper, we first propose an outer bound for the rate region, and show that it is tighter than the outer bound of Tung and Housewright. Our outer bound involves some $n$-letter Markov chain constraints, which cause computational difficulties. We utilize a necessary condition for the Markov chain constraints to obtain another outer bound, which is represented in terms of some single-letter mutual information expressions evaluated over probability distributions that satisfy some single-letter conditions.

Affiliated with

Also associated with

No associations

Rating

An Outer Bound for the Multi-Terminal Rate-Distortion Region 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 An Outer Bound for the Multi-Terminal Rate-Distortion Region, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Outer Bound for the Multi-Terminal Rate-Distortion Region will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-167940