We study the problem of Private Information Retrieval (PIR) in the presence of prior side
information. The problem setup includes a database of K independent messages possibly …

We introduce the concept of “coded computing”, a novel computing paradigm that utilizes
coding theory to effectively inject and leverage data/computation redundancy to mitigate …

Caching is an efficient way to reduce network traffic congestion during peak hours, by
storing some content at the user's local cache memory, even without knowledge of user's …

This work identifies the fundamental limits of multi-access coded caching (MACC) where
each user is connected to multiple caches in a manner that follows a generalized …

We study a multi-access variant of the popular coded caching framework, which consists of a
central server with a catalog of N files, K caches with limited memory M, and K users such …

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 …

Consider an assignment of bits to the vertices of a connected graph with the property that the
value of each vertex is a function of the values of its neighbors. A collection of such …

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 …

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