We present a hypergraph coloring based approach to pliable index coding (PICOD). We
represent the given PICOD problem using a hypergraph consisting of messages as vertices …

We study the fundamental problem of index coding under an additional privacy constraint
that requires each receiver to learn nothing more about the collection of messages beyond …

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

We formulate a new variant of the private information retrieval (PIR) problem where the user
is pliable, ie, interested in any message from a desired subset of the available dataset …

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 …

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 …

In pliable index coding (PICOD), a number of clients are connected via a noise-free
broadcast channel to a server which has a list of messages. Each client has a unique subset …

Pliable index coding studies flexible communication networks where each receiver just
needs to receive any message that it does not already have. In this work, we consider a …

For a multi-source multi-terminal noiseless network, the key-dissemination problem involves
the task of multicasting a secret key K from the network sources to its terminals. As in secure …

Information theory is the foundational mathematical theory for solving communication
problems. The development of communication technology dates back to the dawn of …