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 …

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 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 …

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 …

This paper introduces the decentralized Pliable Index CODing (PICOD) problem: a variant of
the Index Coding (IC) problem, where a central transmitter serves pliable users with …

We propose and study a variant of pliable index coding (PICOD) where receivers have
preferences for their unknown messages and give each unknown message a preference …

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

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 …

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 …