Multiterminal Source Coding with Two Encoders--I: A Computable Outer Bound

Details Multiterminal Source Coding with Two Encoders--I: A Computable Outer Bound Multiterminal Source Coding with Two Encoders--I: A Computable Outer Bound

2006-04-03

arxiv.org/abs/cs/0604005v3

Computer Science

Information Theory

Submitted to the IEEE Transactions on Information Theory; Revised, November 2006. Substantial revision after the first round o

Scientific paper

In this first part, a computable outer bound is proved for the multiterminal
source coding problem, for a setup with two encoders, discrete memoryless
sources, and bounded distortion measures.

Affiliated with

Also associated with

No associations

Rating

Multiterminal Source Coding with Two Encoders--I: A Computable Outer Bound 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 Multiterminal Source Coding with Two Encoders--I: A Computable Outer Bound, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiterminal Source Coding with Two Encoders--I: A Computable Outer Bound will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-444006