A storage code on a graph G is a set of assignments of symbols to the vertices such that
every vertex can recover its value by looking at its neighbors. We consider the question of …

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 study the problem of pliable private information retrieval with side information (PPIR-SI)
for the single server case. In PPIR, the messages are partitioned into nonoverlapping …

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 …

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 …

A storage code is an assignment of symbols to the vertices of a connected graph $ G (V, E) $
with the property that the value of each vertex is a function of the values of its neighbors, or …

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 …

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

A storage code is an assignment of symbols to the vertices of a connected graph G (V, E)
with the property that the value of each vertex is a function of the values of its neighbors, or …

Matroid theory is fundamentally connected with index coding and network coding problems.
In fact, the reliance of linear index coding and network coding rates on the characteristic of a …