A Caltech Library Service

On the Concavity of Rate Regions for Lossless Source Coding in Networks

Gu, Wei-Hsin and Effros, Michelle (2006) On the Concavity of Rate Regions for Lossless Source Coding in Networks. In: 2006 IEEE International Symposium on Information Theory, Seattle, WA, 6-12 July 2006. IEEE , Los Alamitos, CA, pp. 1599-1603. ISBN 1-4244-0504-1.

See Usage Policy.


Use this Persistent URL to link to this item:


For a family of network source coding problems, we prove that the lossless rate region is concave in the distribution of sources. While the proof of concavity is straightforward for the few examples where a single-letter characterization of the lossless source coding region is known, it is more difficult for the vast majority of networks where the lossless source coding region remains unsolved. The class of networks that we investigate includes both solved and unsolved examples. We further conjecture that the same property applies more widely and sketch an avenue for investigating that conjecture.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© Copyright 2006 IEEE. Reprinted with permission. This material is based upon work partially supported by NSF Grant No. CCR-0220039 and Caltech’s Lee Center for Advanced Networking.
Record Number:CaltechAUTHORS:GUWisit06
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:7297
Deposited By: Archive Administrator
Deposited On:26 Jan 2007
Last Modified:08 Nov 2021 20:41

Repository Staff Only: item control page