Separating distributed source coding from network coding

Authors:
Aditya Ramamoorthy;Kamal Jain;Philip A. Chou;Michelle Effros
Affiliations:
Marvell Semiconductor Inc., Santa Clara, CA and Department of Electrical Engineering, University of California, Los Angeles, CA;Microsoft Research, Redmond, WA;Microsoft Research, Redmond, WA;Department of Electrical Engineering, California Institute of Technology, Pasadena, CA
Venue:
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Year:
2006

Citing 8
Cited 7

Packing Steiner trees

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An algebraic approach to network coding

IEEE/ACM Transactions on Networking (TON)
Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
Distributed source coding using syndromes (DISCUS): design and construction

IEEE Transactions on Information Theory
On the capacity of network coding for random networks

IEEE Transactions on Information Theory
Networked Slepian-Wolf: theory, algorithms, and scaling laws

IEEE Transactions on Information Theory
Network information flow with correlated sources

IEEE Transactions on Information Theory

On optimal communication cost for gathering correlated data through wireless sensor networks

Proceedings of the 12th annual international conference on Mobile computing and networking
Information fusion for wireless sensor networks: Methods, models, and classifications

ACM Computing Surveys (CSUR)
On practical design for joint distributed source and network coding

IEEE Transactions on Information Theory
Joint source-channel coding for transmitting correlated sources over broadcast networks

IEEE Transactions on Information Theory
Communicating the sum of sources in a 3-sources/3-terminals network

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Practical source-network decoding

ISWCS'09 Proceedings of the 6th international conference on Symposium on Wireless Communication Systems
Universal source coding over generalized complementary delivery networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.19

Visualization

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.