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 …

We consider a system, comprising a library of N files (eg, movies) and a wireless network
with a KT transmitters, each equipped with a local cache of size of MT files and a KR …

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 …

To address the exponentially rising demand for wireless content, the use of caching is
emerging as a potential solution. It has been recently established that joint design of content …

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 …

This paper aims to provide an optimization framework for coded caching that accounts for
various heterogeneous aspects of practical systems. An optimization theoretic perspective …

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 …

Coded caching has emerged as a promising component of solutions to the exponential
growth in network traffic. Previous approaches to network coding are all based on (simple) …

The centralized coded caching problem is studied for the two-user scenario, considering
heterogeneous cache capacities at the users and private channels from the server to the …