Most of our lives are conducted in the cyberspace. The human notion of privacy translates
into a cyber notion of privacy on many functions that take place in the cyberspace. This …

Caching is a technique to reduce peak traffic rates by prefetching popular content into
memories at the end users. Conventionally, these memories are used to deliver requested …

Replicating or caching popular content in memories distributed across the network is a
technique to reduce peak network loads. Conventionally, the main performance gain of this …

We consider a basic content distribution scenario consisting of a single origin server
connected through a shared bottleneck link to a number of users each equipped with a …

This paper studies linear interference networks, both wired and wireless, with no channel
state information at the transmitters except a coarse knowledge of the end-to-end one-hop …

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 study a noiseless broadcast link serving K users whose requests arise from a library of N
files. Every user is equipped with a cache of size M files each. It has been shown that by …

The index coding problem is studied from an interference alignment perspective providing
new results as well as new insights into, and generalizations of, previously known results …

A new inner bound on the capacity region of the general index coding problem is
established. Unlike most existing bounds that are based on graph theoretic or algebraic …

We present a novel upper bound for the optimal index coding rate. Our bound uses a graph
theoretic quantity called the local chromatic number. We show how a good local coloring …