What makes a source-channel communication system optimal? It is shown that in order to
achieve an optimal cost-distortion tradeoff, the source and the channel have to be matched …

This survey reviews fundamental concepts of multi-user information theory. Starting with
typical sequences, the survey builds up knowledge on random coding, binning …

This paper finds new tight finite-blocklength bounds for the best achievable lossy joint
source-channel code rate, and demonstrates that joint source-channel code design brings …

Source and channel coding over multiuser channels in which receivers have access to
correlated source side information are considered. For several multiuser channel models …

The fundamental limits of" systematic" communication are analyzed. In systematic
transmission, the decoder has access to a noisy version of the uncoded raw data (analog or …

We discuss reliable transmission of a discrete memoryless source over a discrete
memoryless broadcast channel, where each receiver has side information (of arbitrary …

A simple proof of the coding theorem for the multiple-access channel (MAC) with arbitrarily
correlated sources (DMCS) of Cover-El Carnal-Salehi, which includes the results of …

The Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC) is considered.
The dirty-paper coding (DPC) rate region is shown to coincide with the capacity region. To …

Methods are developed that achieve all rate points inside the capacity region of two-receiver
memoryless broadcast channels where each receiver knows the message it need not …

A communication setup is considered where a single transmitter wishes to convey
messages to one or two receivers and simultaneously estimate the states of the receivers …