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 …

In this paper, we take a unified approach for network information theory and prove a coding
theorem, which can recover most of the achievability results in network information theory …

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 …

Motivated by recent advances in joint source-channel coding over networks, hybrid
(analog/digital) coding has been proposed as a coding technique for discrete memoryless …

In this paper, we generalize the lossless coded side information problem from the three-
node network of Ahlswede and Korner to more general network scenarios. We derive inner …

An achievable rate region based on Shannon's inner bound is given for the two-way relay
channel. The relaying scheme operates on noisy received signals and generates new …

We consider the problem of communication over a network containing a hidden and
malicious adversary that can control a subset of network resources, and aims to disrupt …

Coding scheme for discrete memoryless multicast networks with rate-limited feedback from
the receivers and relays to the transmitter is proposed. The coding scheme is based on …

The performance of wireless networks can be enhanced by performing network coding on
the intermediate relay nodes. To enhance the throughput of large wireless networks, we can …

This paper studies the problem of the distributed compression of correlated sources with an
action-dependent joint distribution. This class of problems is, in fact, an extension of the …