We consider a basic cache network, in which a single server is connected to multiple users
via a shared bottleneck link. The server has a database of files (content). Each user has an …

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 …

Building on the recent coded-caching breakthrough by Maddah-Ali and Niesen, the work
here considers the K-user cache-aided wireless multi-antenna symmetric broadcast channel …

An erasure broadcast network is considered with two disjoint sets of receivers: a set of weak
receivers with all-equal erasure probabilities and equal cache sizes and a set of strong …

We consider the content delivery problem in a fading multi-input single-output channel with
cache-aided users. We are interested in the scalability of the equivalent content delivery rate …

Multi-antenna cache-aided wireless networks were thought to suffer from a severe feedback
bottleneck, since achieving the maximal Degrees-of-Freedom (DoF) performance required …

Degraded K-user broadcast channels (BCs) are studied when the receivers are facilitated
with cache memories. Lower and upper bounds are derived on the capacity-memory …

Improved lower bounds are derived on the average and worst case rate-memory tradeoffs of
the Maddah-Ali and Niesen-coded caching scenario. For any number of users and files and …

We explore the performance of coded caching in a SISO BC setting where some users have
higher link capacities than others. Focusing on a binary and fixed topological model where …

This work investigates the interplay of coded caching and spatial multiplexing in an
overloaded Multiple-Input-Single-Output (MISO) Broadcast Channel (BC), ie a system where …