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 …

In the context of coded caching in the K-user broadcast channel, our work reveals the
surprising fact that having multiple (L) transmitting antennas, dramatically ameliorates the …

The work explores the fundamental limits of coded caching in the setting where a transmitter
with potentially multiple (N 0) antennas serves different users that are assisted by a smaller …

Caching is an efficient way to reduce peak hour network traffic congestion by storing some
content at the user's cache without knowledge of later demands. Recently, Maddah-Ali and …

Local caching is an effective scheme for leveraging the memory of the mobile terminal (MT)
and short range communications to save the bandwidth usage and reduce the download …

The capacity of caching networks has received considerable attention in the past few years.
The problem consists of finding the minimum rate (or load) to deliver all users' requested …

One of the major goals of the 5G technology roadmap is to create disruptive innovation for
the efficient use of the radio spectrum to enable rapid access to bandwidth-intensive …

The capacity of caching networks has received considerable attention in the past few years.
A particularly studied setting is the shared link caching network, in which a single source …

The decentralized coded caching scheme of Maddah-Ali and Niesen for the shared link
network achieves an order-optimal memory-load tradeoff when the file size goes to infinity. It …