Separating distributed source coding from network coding

作     者：Ramamoorthy, Aditya Jain, Kamal Chou, Philip A. Effros, Michelle 

作者机构：Univ Calif Los Angeles Dept Elect Engn Los Angeles CA 90095 USA CALTECH Dept Elect Engn Pasadena CA 91125 USA 

出 版 物：《IEEE TRANSACTIONS ON INFORMATION THEORY》 (IEEE Trans. Inf. Theory)

年 卷 期：2006年第52卷第6期

页      面：2785-2795页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：distributed source coding multicast network coding separation 

摘      要：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.