An Infeasibility Result for the Multiterminal Source-Coding Problem

Details An Infeasibility Result for the Multiterminal Source-Coding Problem An Infeasibility Result for the Multiterminal Source-Coding Problem

2005-11-30

arxiv.org/abs/cs/0511103v1

Computer Science

Information Theory

42 pages; submitted to IEEE Trans. Inf. Theory

Scientific paper

We prove a new outer bound on the rate-distortion region for the multiterminal source-coding problem. This bound subsumes the best outer bound in the literature and improves upon it strictly in some cases. The improved bound enables us to obtain a new, conclusive result for the binary erasure version of the "CEO problem." The bound recovers many of the converse results that have been established for special cases of the problem, including the recent one for the Gaussian version of the CEO problem.

Affiliated with

Also associated with

No associations

Rating

An Infeasibility Result for the Multiterminal Source-Coding Problem 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 Infeasibility Result for the Multiterminal Source-Coding Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Infeasibility Result for the Multiterminal Source-Coding Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-429636