A Caltech Library Service

On achievable rates for multicast in the presence of side information

Bakshi, Mayank and Effros, Michelle (2008) On achievable rates for multicast in the presence of side information. In: IEEE International Symposium on Information Theory (ISIT 2008), Toronto, Canada, 6-11 July 2008. IEEE , Piscataway, NJ, pp. 1661-1665. ISBN 978-1-4244-2256-2.

PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


We investigate the network source coding rate region for networks with multiple sources and multicast demands in the presence of side information, generalizing earlier results on multicast rate regions without side information. When side information is present only at the terminal nodes, we show that the rate region is precisely characterized by the cut-set bounds and that random linear coding suffices to achieve the optimal performance. When side information is present at a non-terminal node, we present an achievable region. Finally, we apply these results to obtain an inner bound on the rate region for networks with general source-demand structures.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© Copyright 2008 IEEE. Reprinted with permission. Current Version Published: 2008-08-08. This material is based upon work partially supported by NSF Grant No. CCF-0325324 and Caltech's Lee Center for Advanced Networking.
Funding AgencyGrant Number
National Science FoundationCCF-0325324
Lee Center for Advanced Networking, CaltechUNSPECIFIED
Subject Keywords:linear codes; multicast communication; random codes; source coding
Record Number:CaltechAUTHORS:BAKisit08
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:11948
Deposited By: Archive Administrator
Deposited On:13 Oct 2008 21:33
Last Modified:08 Nov 2021 22:23

Repository Staff Only: item control page