Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published June 2006 | public
Journal Article Open

Separating distributed source coding from network coding

Abstract

This correspondence considers the problem of distributed source coding of multiple sources over a network with multiple receivers. Each receiver seeks to reconstruct all of the original sources. The work by Ho et al. 2004 demonstrates that random network coding can solve this problem at the potentially high cost of jointly decoding the source and the network code. Motivated by complexity considerations we consider the performance of separate source and network codes. Previous work by Effros et al. 2003 demonstrates the failure of separation between source and network codes for nonmulticast networks. We demonstrate that failure for multicast networks. We study networks with capacity constraints on edges. It is shown that the problem with two sources and two receivers is always separable. Counterexamples are presented for other cases.

Additional Information

© Copyright 2006 IEEE Manuscript received March 14, 2005; revised February 7, 2006. [Posted online: 2006-06-05] The material in this paper was presented in part at the 42nd Allerton Conference on Communication, Control and Computing, Monticello, IL, October 2004. Communicated by R. W. Yeung, Guest Editor. The authors would like to acknowledge the anonymous reviewers whose comments greatly improved the quality of the correspondence. The first author would like to acknowledge interesting comments from Dr. N. Vaswani and Dr. P. Chaichanavong on this correspondence.

Files

RAMieeetit06.pdf
Files (451.3 kB)
Name Size Download all
md5:abb26570bb5c54342b05e090e6d87a66
451.3 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 16, 2023