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 consider the standard broadcast setup with a single server broadcasting information to a
number of clients, each of which contains local storage (called cache) of some size, which …

In this work, we consider a slight variant of well known coded caching problem, referred as
multi-access coded caching problem, where each user has access to $ z $ neighboring …

The most commonly used setting in the coded caching literature consists of the following
four elements:(i) homogeneous file sizes,(ii) homogeneous cache sizes,(iii) user …

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 …

Coded caching is a novel mechanism to relieve wireless congestion during peak-traffic
times for content distribution [6][7], where the temporal variability of wireless traffics is …

The work considers the K-user cache-aided sharedlink broadcast channel where each user
has access to exactly z caches of normalized size γ, and where each cache assists exactly z …

Maddah-Ali and Niesen, in a seminal paper, introduced the notion of coded caching. The
exact nature of the fundamental limits in this context has remained elusive even as several …

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 …

Coded Caching is a promising solution to reduce the peak traffic in broadcast networks by
prefetching the popular content close to end users and using coded transmissions. One of …