Index coding is a canonical problem in network information theory that studies the
fundamental limit and optimal coding schemes for broadcasting multiple messages to …

We consider the coded caching problem with an additional privacy constraint that a user
should not get any information about the demands of the other users. We first show that a …

The Pliable Index CODing (PICOD) problem is a variant of the Index Coding (IC) problem,
where the desired messages by the users, who are equipped with message side …

We study the index coding problem in the presence of an eavesdropper, where the aim is to
communicate without allowing the eavesdropper to learn any single message aside from the …

This paper studies a variant of the Pliable Index CODing (PICOD) problem, ie, an index
coding problem where a user can be satisfied by decoding any message that is not in its …

In the traditional index coding problem, a server employs coding to send messages to a set
of clients within the same broadcast domain. Each client already has some messages as …

Index coding is concerned with efficient broadcast of a set of messages to receivers in the
presence of receiver side information. In this paper, we study the secure index coding …

We consider a transmitter and receivers, each of which shares a key variable with the
transmitter. Through a noiseless broadcast channel, the transmitter wishes to send a …

This paper studies the tradeoff in privacy and utility in a single-trial multi-terminal guessing
(estimation) framework using a system model that is inspired by index coding. There are n …

In this paper, we propose a new scalar linear coding scheme for the index coding problem
called update-based maximum column distance (UMCD) coding scheme. The central idea …