Slepian-Wolf coding over cooperative networks

Authors:
Mohammad Hossein Yassaee;Mohammad Reza Aref
Affiliations:
Information Systems and Security Lab, EE Department, Sharif University of Technology, Tehran, Iran;Information Systems and Security Lab, EE Department, Sharif University of Technology, Tehran, Iran
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Year:
2009

Citing 6
Cited 0

Wireless network information flow: a deterministic approach

Wireless network information flow: a deterministic approach
Cooperative Strategies and Capacity Theorems for Relay Networks

IEEE Transactions on Information Theory
Slepian-Wolf coding over broadcast channels

IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast

IEEE Transactions on Information Theory
Offset Encoding for Multiple-Access Relay Channels

IEEE Transactions on Information Theory
Multisource, Multidestination, Multirelay Wireless Networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present sufficient conditions for multicasting a set of correlated sources over cooperative networks. We propose a joint source-Wyner-Ziv encoding/sliding-window decoding scheme, in which each receiver considers an ordered partition of the other nodes. For each ordered partition, we obtain a set of feasibility constraints. We consolidate the results of the 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, where two nodes want to communicate over a relay network.