This paper studies the Pliable Index CODing problem (PICOD), which models content-type
distribution networks. In the PICOD (t) problem there are m messages, n users and each …

We present the ImpGrCov algorithm–a novel algorithm for devising binary linear codes for
pliable index coding that have lower codelengths than those devised using state-of-the-art …

The K User Linear Computation Broadcast (LCBC) problem is comprised of d dimensional
data (from), that is fully available to a central server, and K users, who require various linear …

Coded caching is an emerging technique to reduce the data transmission load during the
peak-traffic times. In such a scheme, each file in the data center or library is divided into a …

The Private Information Retrieval (PIR) problem has recently attracted a significant interest in
the information-theory community. In this problem, a client wants to download one or more …

Coded caching is a technique that promises huge reductions in network traffic in content-
delivery networks. However, the original formulation and several subsequent contributions …

We characterise the optimal broadcast rate for a few classes of pliable-index-coding
problems. This is achieved by devising new lower bounds that utilise the set of absent …

In index coding, a server broadcasts multiple messages to their respective receivers, each
with some side information that can be utilized to reduce the amount of communication from …

It has been known that the insufficiency of linear coding in achieving the optimal rate of the
general index coding problem is rooted in its rate's dependency on the field size. However …

The original coded caching scenario assumes a content library that is of interest to all
receiving users. In a realistic scenario though, the users may have diverging interests which …