Slepian-Wolf Coding over Cooperative Networks
| dc.creator | Yassaee, Mohammad Hossein | |
| dc.creator | Aref, Mohammad Reza | |
| dc.date | 2009-01-15 | |
| dc.date.accessioned | 2026-07-07T12:29:39Z | |
| dc.date.available | 2026-07-07T12:29:39Z | |
| dc.description | 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. | |
| dc.description | 5 pages, submitted to ISIT 2009 | |
| dc.identifier | https://arxiv.org/abs/0901.2218 | |
| dc.identifier | http://arxiv.org/abs/0901.2218 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/215950 | |
| dc.subject | Information Theory | |
| dc.title | Slepian-Wolf Coding over Cooperative Networks | |
| dc.type | text |