English

Slepian-Wolf Coding over Cooperative Networks

Information Theory 2009-01-16 v1 math.IT

Abstract

We present sufficient conditions for multicasting a set of correlated sources over cooperative networks. We propose joint source-Wyner-Ziv encoding/sliding-window decoding scheme, in which each receiver considers an ordered partition of other nodes. Subject to this scheme, we obtain a set of feasibility constraints for each ordered partition. We consolidate the results of different ordered partitions by utilizing a result of geometrical approach to obtain the sufficient conditions. We observe that these sufficient conditions are indeed necessary conditions for Aref networks. As a consequence of the main result, we obtain an achievable rate region for networks with multicast demands. Also, we deduce an achievability result for two-way relay networks, in which two nodes want to communicate over a relay network.

Keywords

Cite

@article{arxiv.0901.2218,
  title  = {Slepian-Wolf Coding over Cooperative Networks},
  author = {Mohammad Hossein Yassaee and Mohammad Reza Aref},
  journal= {arXiv preprint arXiv:0901.2218},
  year   = {2009}
}

Comments

5 pages, submitted to ISIT 2009

R2 v1 2026-06-21T12:01:10.816Z