Campus Units

Electrical and Computer Engineering

Document Type

Conference Proceeding

Conference

2007 IEEE International Symposium on Information Theory

Publication Version

Accepted Manuscript

Link to Published Version

https://doi.org/10.1109/ISIT.2007.4557476

Publication Date

2007

Journal or Book Title

IEEE International Symposium on Information Theory, 2007. ISIT 2007.

First Page

1761

Last Page

1765

DOI

10.1109/ISIT.2007.4557476

Conference Title

2007 IEEE International Symposium on Information Theory

Conference Date

June 24-29, 2007

City

Nice, France

Abstract

This work considers the problem of transmitting multiple compressible sources over a network with minimum cost. 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 that 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 subgradient methods.

Comments

This is a manuscript of a proceeding from the IEEE International Symposium on Information Theory (2007): 1761, doi:10.1109/ISIT.2007.4557476. Posted with permission.

Rights

Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Copyright Owner

IEEE

Language

en

File Format

application/pdf

Published Version

Share

Article Location

 
COinS