Coding schemes for several problems in network information theory are constructed starting
from point-to-point channel codes that are designed for symmetric channels. Given that the …

The problem of computing sum of sources over a multiple access channel (MAC) is
considered. Building on the technique of linear computation coding (LCC) proposed by …

We prove that the ensemble of the nested coset codes built on finite fields achieves the
capacity of arbitrary discrete memoryless point-to-point channels. Exploiting its algebraic …

We consider the problem of developing coding techniques and deriving achievable rate
regions for discrete memoryless broadcast channels with three receivers (3-DBC). We begin …

Coding schemes for asymmetric channels and channels with state are developed starting
from a pair of linear codes designed for symmetric channels. Guarantees on the block error …

We present an achievable rate region for the general three user discrete broadcast channel
(DBC), based on coset codes. We identify an example of a three user DBC for which the …

The 3-user discrete memoryless interference channel is considered in this paper. We
provide a new inner bound (achievable rate region) to the capacity region for this channel …

In this paper, we show that nested lattice codes achieve the capacity of arbitrary continuous
channels with or without non-causal state information at the transmitter. We also show that …

In this paper, we introduce a new class of codes, called weighted parity-check codes, where
each parity-check bit has a weight that indicates its likelihood to be one (instead of fixing …

We consider the problem of developing coding techniques and characterizing information-
theoretic achievable rate regions for the following three multi-terminal communication …