Computer Science – Information Theory
Scientific paper
2005-11-12
Computer Science
Information Theory
submitted to IEEE Informatoin Theory Workshop 2006
Scientific paper
We are interested in how to best communicate a (usually real valued) source to a number of destinations (sinks) over a network with capacity constraints in a collective fidelity metric over all the sinks, a problem which we call joint network-source coding. Unlike the lossless network coding problem, lossy reconstruction of the source at the sinks is permitted. We make a first attempt to characterize the set of all distortions achievable by a set of sinks in a given network. While the entire region of all achievable distortions remains largely an open problem, we find a large, non-trivial subset of it using ideas in multiple description coding. The achievable region is derived over all balanced multiple-description codes and over all network flows, while the network nodes are allowed to forward and duplicate data packets.
Sarshar Nima
Wu Xiaolin
No associations
LandOfFree
Joint Network-Source Coding: An Achievable Region with Diversity Routing 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 Joint Network-Source Coding: An Achievable Region with Diversity Routing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Joint Network-Source Coding: An Achievable Region with Diversity Routing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-408067