We consider a wireless device-to-device (D2D) network where communication is restricted
to be single-hop. Users make arbitrary requests from a finite library of files and have pre …

We consider the canonical shared link caching network formed by a source node, hosting a
library of m information messages (files), connected via a noiseless multicast link to n user …

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

Index coding studies multiterminal source-coding problems where a set of receivers are
required to decode multiple (possibly different) messages from a common broadcast, and …

This paper studies a special class of multicast index coding problems where a sender
transmits messages to multiple receivers, each with some side information. Here, each …

We formulate a new variant of the index coding problem, where instead of demanding a
specific message, clients are pliable, and are interested in receiving any t messages that …

We analyze a generalized index coding problem that allows multiple users to request the
same packet. For this problem we introduce a novel coding scheme called partition …

In this paper, we introduce a model of a distributed storage system that is locally recoverable
from any single server failure. Unlike the usual local recovery model of codes for distributed …

Cooperative communication has the potential of providing better throughput and reliability to
wireless systems when compared with direct communication. To realise the potential gain, it …

We establish a duality result between linear index coding and Locally Repairable Codes
(LRCs). Specifically, we show that a natural extension of LRCs we call Generalized Locally …