Foundations and Trends® in Networking
Joint source-channel coding for transmitting correlated sources over broadcast networks
IEEE Transactions on Information Theory
Source and channel coding for correlated sources over multiuser channels
IEEE Transactions on Information Theory
Joint distributed source and network coding for multiple wireless unicast sessions
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Gaussian broadcast channels with receiver message side information
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Nonlinear network code for high throughput broadcasting with retransmissions
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Slepian-Wolf coding over cooperative networks
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
The rate transfer argument in two-stage scenarios: when does it matter?
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Reliable source transmission over relay networks with side information
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Wyner-Ziv coding over broadcast channels: digital schemes
IEEE Transactions on Information Theory
Interference channels with correlated receiver side information
IEEE Transactions on Information Theory
Opportunistic adaptive transmission for network coding using nonbinary LDPC codes
EURASIP Journal on Wireless Communications and Networking - Special issue on physical-layer network coding for wireless cooperative networks
Hi-index | 755.08 |
We discuss reliable transmission of a discrete memoryless source over a discrete memoryless broadcast channel, where each receiver has side information (of arbitrary quality) about the source unknown to the sender. When there are K=2 receivers, the optimum coding strategy using separate and stand-alone source and channel codes is to build two independent binning structures and send bin indices using degraded message sets through the channel, yielding a full characterization of achievable rates. However, as we show with an example, generalization of this technique to multiple binning schemes does not fully resolve the K>2 case. Joint source-channel coding, on the other hand, allows for a much simpler strategy (i.e., with no explicit binning) yielding a successful single-letter characterization of achievable rates for any Kges2. This characterization, which utilizes a trivial outer bound to the capacity region of general broadcast channels, is in terms of marginal source and channel distributions rather than a joint source-channel distribution. This contrasts with existing results for other multiterminal scenarios and implies that optimal schemes achieve "operational separation." On the other hand, it is shown with an example that an optimal joint source-channel coding strategy is strictly advantageous over the combination of stand-alone source and channel codes, and thus "informational separation" does not hold