Dynamic index coding is a practical generalization of conventional index coding that deals
with real dynamic traffic streams. We identify the code-constrained capacity region of a …

In the pliable variant of index coding, receivers are allowed to decode any new message not
known a priori. Optimal code design for this variant involves identifying each receiver's …

Index coding can be viewed as a compression problem with multiple decoders with side
information. In such a setup, an encoder compresses a number of messages into a common …

We consider the link scheduling problem in wireless mesh networks for capacity
maximization. Unlike all previous approaches, ours views capacity in terms of covering a …

We study the information leakage to a guessing adversary in zero-error source coding. The
source coding problem is defined by a confusion graph capturing the distinguishability …

The topological interference management (TIM) problem refers to the study of the K-user
partially connected interference networks with no channel state information at the …

We extend the composite coding (CC) scheme for the index coding problem from two layers
to more layers of random binning. We explicitly introduce the three-layer composite coding …

The groupcast index coding (GIC) problem is a generalization of the index coding problem,
where one packet can be demanded by multiple users. In this paper, we propose a new …

Insufficiency of linear coding for the network coding problem was first proved by providing an
instance which is solvable only by nonlinear network coding (Dougherty et al., 2005). Based …

The index coding problem is concerned with the amount of information that a sender has to
transmit to multiple receivers in a way that enables each of them to retrieve its requested …