In the Shannon-theoretic analysis of joint source-channel coding problems, achievability is
usually established via a two-stage approach: The sources are compressed into bits, and …

In the Shannon-theoretic analysis of joint source-channel coding problems, achievability is
usually established via a two-stage approach: The sources are compressed into bits, and …

In this monograph, we develop a mathematical framework based on asymptotically good
random structured codes, ie, codes possessing algebraic properties, for network information …

For a general class of Gaussian network source coding problems for which no single-letter
characterization of the rate-distortion region is known, it is shown that the rate-distortion …

We consider the problem of source coding with receiver side information for the simple
network proposed by R. Gray and A. Wyner in 1974. In this network, a transmitter must …

We prove a strong converse for particular source coding problems: the Ahlswede-Korner
(coded side information) problem, lossless source coding for multicast networks with side …

In this paper, we prove a unified achievability bound that generalizes and improves random
coding bounds for any combination of source coding, channel coding, joint source-channel …

Random coding arguments are the backbone of most channel capacity achievability proofs.
In this paper, we show that in their standard form, such arguments are insufficient for proving …

A distributed source coding problem with a joint distortion criterion that depends on the
sources and the reconstruction is considered in this work. While the prevalent trend in …

This correspondence considers the problem of distributed source coding of multiple sources
over a network with multiple receivers. Each receiver seeks to reconstruct all of the original …