Bakshi, Mayank and Effros, Michelle and Gu, WeiHsin and Koetter, Ralf (2008) On Network Coding of Independent and Dependent Sources in Line Networks. In: IEEE International Symposium on Information Theory (ISIT 2007), Nice France, 24-29 June 2007. IEEE , Piscataway, NJ, pp. 1096-1100. ISBN 978-1-4244-1397-3 http://resolver.caltech.edu/CaltechAUTHORS:BAKisit07
- Published Version
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:BAKisit07
We investigate the network coding capacity for line networks. For independent sources and a special class of dependent sources, we fully characterize the capacity region of line networks for all possible demand structures (e.g., multiple unicast, mixtures of unicasts and multicasts, etc.) Our achievability bound is derived by first decomposing a line network into single-demand components and then adding the component rate regions to get rates for the parent network. For general dependent sources, we give an achievability result and provide examples where the result is and is not tight.
|Item Type:||Book Section|
|Additional Information:||© Copyright 2007 IEEE. Reprinted with permission. Current Version Published: 2008-07-09. This material is based upon work partially supported by NSF Grant Nos. CCF-0220039, CCR-0325324 and Caltech's Lee Center for Advanced Networking.|
|Subject Keywords:||network coding|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||13 Oct 2008 19:49|
|Last Modified:||26 Dec 2012 10:24|
Repository Staff Only: item control page