Minimum cost distributed source coding over a network

Details Minimum cost distributed source coding over a network Minimum cost distributed source coding over a network

2007-04-23

arxiv.org/abs/0704.2808v2

Computer Science

Information Theory

First version apppeared in the Proceedings of the 2007 IEEE International Symposium on Information Theory, Nice, France, June

Scientific paper

This work considers the problem of transmitting multiple compressible sources over a network at minimum cost. The aim is to find the optimal rates at which the sources should be compressed and the network flows using which they should be transmitted so that the cost of the transmission is minimal. We consider networks with capacity constraints and linear cost functions. The problem is complicated by the fact that the description of the feasible rate region of distributed source coding problems typically has a number of constraints that is exponential in the number of sources. This renders general purpose solvers inefficient. We present a framework in which these problems can be solved efficiently by exploiting the structure of the feasible rate regions coupled with dual decomposition and optimization techniques such as the subgradient method and the proximal bundle method.

Affiliated with

Also associated with

No associations

Rating

Minimum cost distributed source coding over a network 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 Minimum cost distributed source coding over a network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimum cost distributed source coding over a network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-194299