Aditya Ramamoorthy, Kamal Jain, Philip A. Chou, and Michelle Effros
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.
|Published in||IEEE Trans. Information Theory|
|Publisher||Institute of Electrical and Electronics Engineers, Inc.|
© 2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.