Joint Network-Source Coding: An Achievable Region with Diversity Routing
| dc.creator | Sarshar, Nima | |
| dc.creator | Wu, Xiaolin | |
| dc.date | 2005-11-12 | |
| dc.date.accessioned | 2026-07-07T08:15:45Z | |
| dc.date.available | 2026-07-07T08:15:45Z | |
| dc.description | 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. | |
| dc.description | submitted to IEEE Informatoin Theory Workshop 2006 | |
| dc.identifier | https://arxiv.org/abs/cs/0511048 | |
| dc.identifier | http://arxiv.org/abs/cs/0511048 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133548 | |
| dc.subject | Information Theory | |
| dc.title | Joint Network-Source Coding: An Achievable Region with Diversity Routing | |
| dc.type | text |