Article
Separating Distributed Source Coding from Network Coding
IEEE Transactions on Information Theory
(2006)
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.
Keywords
- Source coding,
- Network coding,
- Decoding,
- Costs,
- Linear code,
- Statistical distributions,
- Video coding,
- Capacity planning,
- Semiconductor materials,
- Communication system control
Disciplines
Publication Date
June, 2006
DOI
10.1109/TIT.2006.874534
Publisher Statement
Copyright 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Posted with permission.
Citation Information
Aditya Ramamoorthy, Kamal Jain, Philip A. Chou and Michelle Effros. "Separating Distributed Source Coding from Network Coding" IEEE Transactions on Information Theory Vol. 52 Iss. 6 (2006) p. 2785 - 2795 Available at: http://works.bepress.com/aditya-ramamoorthy/55/