#### DMCA

## Separating Distributed Source Coding from Network Coding (2006)

### Cached

### Download Links

- [authors.library.caltech.edu]
- [authors.library.caltech.edu]
- [research.microsoft.com]
- [www.ece.iastate.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 60 - 10 self |

### Citations

1922 | Weung, “Network information flow
- Ahlswede, Cai, et al.
- 2000
(Show Context)
Citation Context ...etwork flow problems when intermediate nodes in the network have the ability to forward functions of received packets rather than forwarding the packets unchanged. The seminal work of Ahlswede et al. =-=[6]-=- shows that network coding achieves the capacity of single-source, multiple-terminal multicast. Subsequent work [7], [8] shows that linear network coding is sufficient to achieve this capacity. Moreov... |

1247 |
Noiseless coding of correlated information sources
- Slepian, Wolf
- 2004
(Show Context)
Citation Context ...eivers is always separable. Counterexamples are presented for other cases. Index Terms—Distributed source coding, multicast, network coding, separation. I. INTRODUCTION The Slepian–Wolf (S–W) theorem =-=[1]-=- states that the lossless compression of two correlated sources that do not communicate with each other can be as efficient as the compression of the two sources that do communicate with each other. C... |

990 | Linear network coding - Li, Yeung, et al. - 2003 |

839 | An algebraic approach to network coding
- Koetter, Médard
- 2003
(Show Context)
Citation Context ...ther than forwarding the packets unchanged. The seminal work of Ahlswede et al. [6] shows that network coding achieves the capacity of single-source, multiple-terminal multicast. Subsequent work [7], =-=[8]-=- shows that linear network coding is sufficient to achieve this capacity. Moreover, random linear network coding, which is an efficient distributed strategy, achieves this capacity with high probabili... |

450 | Practical network coding
- Chou, Wu, et al.
- 2003
(Show Context)
Citation Context ...hat linear network coding is sufficient to achieve this capacity. Moreover, random linear network coding, which is an efficient distributed strategy, achieves this capacity with high probability [9], =-=[10]-=-. The multicast capacity of large random networks is considered in [11]. Variants of this problem involving multiple sources and multiple receivers are significantly harder and far less is known about... |

403 | Distributed source coding using syndromes (DISCUS): Design and construction
- Pradhan, Ramchandran
- 1999
(Show Context)
Citation Context ...oders are assumed in all three of these works. To the best of our knowledge, Wyner was the first to propose a constructive approach for the S-W problem in [15]. It was used by Pradhan and Ramchandran =-=[16]-=- for practical S–W code design when the correlation between ˆ and ‰ can be modeled by a binary symmetric channel, i.e., when ‰ can be considered to be a noisy version of ˆ and the noise can be modeled... |

218 | Distributed source coding for sensor networks
- Xiong, Liveris, et al.
- 2004
(Show Context)
Citation Context ...ows the existence of a universal decoder that successfully decodes without requiring the knowledge of the joint statistics of the sources. In recent years there has been a flurry of activity (see [3]–=-=[5]-=- and their references) on code design for this distributed compression problem (hereafter referred to as the S–W problem), spurred mainly by applications in sensor networks and video coding problems. ... |

198 | On randomized network coding
- Ho, Médard, et al.
- 2003
(Show Context)
Citation Context ...ows that linear network coding is sufficient to achieve this capacity. Moreover, random linear network coding, which is an efficient distributed strategy, achieves this capacity with high probability =-=[9]-=-, [10]. The multicast capacity of large random networks is considered in [11]. Variants of this problem involving multiple sources and multiple receivers are significantly harder and far less is known... |

181 |
Recent results in the Shannon theory
- Wyner
- 1974
(Show Context)
Citation Context ...s maximum entropy or maximum a posteriori decoders are assumed in all three of these works. To the best of our knowledge, Wyner was the first to propose a constructive approach for the S-W problem in =-=[15]-=-. It was used by Pradhan and Ramchandran [16] for practical S–W code design when the correlation between ˆ and ‰ can be modeled by a binary symmetric channel, i.e., when ‰ can be considered to be a no... |

146 | Compression of correlated binary sources using turbo codes - Garcia-Frias, Zhao - 2001 |

103 |
Linear codes for sources and source networks: Error exponents, universal coding
- Csiszár
- 1982
(Show Context)
Citation Context ... lossless compression of two correlated sources that do not communicate with each other can be as efficient as the compression of the two sources that do communicate with each other. Csiszár shows in =-=[2]-=- that linear codes are sufficient to achieve the S–W bounds and computes error-exponents for various decoders. In that paper, he also shows the existence of a universal decoder that successfully decod... |

91 | Network information flow with correlated sources
- Barros, Servetto
- 2006
(Show Context)
Citation Context ...t. and ‚I C ‚P ��� E™��@�ƒIYƒP�Y„IAX (4) If g„ has a nonempty intersection with the S-W region defined in (1) – (3), then the problem has a solution (for proofs of the necessity of this condition see =-=[17]-=- and [18]). We pick a rational rate vector @‚ „ ƒ Y‚„ A that belongs to this intersection ƒ and choose � sufficiently large such that �‚ „ ƒ and �‚„ ƒ are integers. 2) Over � time units, route the cod... |

90 | Networked SlepianWolf: theory, algorithms, and scaling laws
- Cristescu, Beferull-Lozano, et al.
- 2005
(Show Context)
Citation Context ...ech.edu). Communicated by R. W. Yeung, Guest Editor. Digital Object Identifier 10.1109/TIT.2006.874534 do not have capacities on them. The S-W problem over a network is considered by Cristescu et al. =-=[12]-=- in the context of one receiver but they impose costs on edges rather than considering capacities on edges. In practical applications such as sensor networks, however, one would expect that the source... |

63 | Network coding for correlated sources
- Ho, Médard, et al.
(Show Context)
Citation Context ...problem of deciding the feasibility of a given distributed source coding problem with multiple sources and multiple receivers an interesting and important one. This problem is considered by Ho et al. =-=[13]-=-. They show by using the approach pioneered by Csiszár that as long as the minimum cuts between all nonempty subsets of sources and a particular receiver are larger than the corresponding conditional ... |

46 | On the capacity of network coding for random networks
- Ramamoorthy, Shi, et al.
- 2003
(Show Context)
Citation Context ...ver, random linear network coding, which is an efficient distributed strategy, achieves this capacity with high probability [9], [10]. The multicast capacity of large random networks is considered in =-=[11]-=-. Variants of this problem involving multiple sources and multiple receivers are significantly harder and far less is known about them. It is important to note that the classical S-W problem does not ... |

46 |
Slepian-Wolf-Cover Theorem for a Network of Channels
- Han
- 1980
(Show Context)
Citation Context ... C ‚P ��� E™��@�ƒIYƒP�Y„IAX (4) If g„ has a nonempty intersection with the S-W region defined in (1) – (3), then the problem has a solution (for proofs of the necessity of this condition see [17] and =-=[18]-=-). We pick a rational rate vector @‚ „ ƒ Y‚„ A that belongs to this intersection ƒ and choose � sufficiently large such that �‚ „ ƒ and �‚„ ƒ are integers. 2) Over � time units, route the coded bits f... |

44 | Linear network codes: A unified framework for source channel, and network coding - Effros, Médard, et al. |

28 | On practical design for joint distributed source and network coding
- Wu, Stankovic, et al.
- 2009
(Show Context)
Citation Context ...oding techniques. While this approach is promising in an information-theoretic sense, it fails to provide a practical solution to the problem. However, recent progress has been made in this direction =-=[19]-=-. 3) Transmit the coded bits via appropriate network coding such that „I and „P can recover the original source-coded bits. The approach here is to design a network code so that the recovery of a suff... |

27 | Distributed compression in a dense sensor network
- Pradhan, Kusuma, et al.
- 2002
(Show Context)
Citation Context ...source codes for the classical S–W problem (based on linear codes) are used as the source encoders in the source nodes ƒ H IY FFFYƒ H x , then the corresponding practical source decoders (outlined in =-=[3]-=- and [5]) can be used to recover the sources after a linear inversion of the network code. III. RESULTS FOR NETWORKS WITH CAPACITY CONSTRAINTS In this section we present various results that character... |

2 |
Subtree decomposition for network coding
- Fragouli, Soljanin
(Show Context)
Citation Context ...ted in Fig. 5 which in turn implies separability. The fact that a connection involving two sources and two receivers can be decomposed in two routed flows and one network coded flow was also noted in =-=[21]-=-. However, the proof presented is in the context of compressible sources and proceeds via a completely different approach that may be of independent interest. This result is somewhat surprising in lig... |