Fundamental limits of coded caching with multiple antennas, shared caches and uncoded prefetching

E Parrinello, A Ünsal, P Elia - IEEE Transactions on Information …, 2019 - ieeexplore.ieee.org
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 …

Multi-antenna coded caching from a placement delivery array for shared caches

E Peter, BS Rajan - IEEE Transactions on Communications, 2022 - ieeexplore.ieee.org
The coded caching problem with shared caches where the server is equipped with multiple
transmit antennas is considered. In a shared cache network, several users share a cache …

Coded caching with shared caches from generalized placement delivery arrays

E Peter, BS Rajan - … on Personal, Indoor and Mobile Radio …, 2021 - ieeexplore.ieee.org
We consider the coded caching problem with shared caches where several users share a
cache, but each user has access to only a single cache. For this network, the fundamental …

Fundamental limits of topology-aware shared-cache networks

E Parrinello, A Bazco-Nogueras… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
This work studies a well-known shared-cache coded caching scenario where each cache
can serve an arbitrary number of users. We analyze the case where there is some …

Fundamental limits of stochastic shared-cache networks

A Malik, B Serbetci, E Parrinello… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
The work establishes the exact performance limits of stochastic coded caching when users
share a bounded number of cache states, and when the association between users and …

Shared cache coded caching schemes with known user-to-cache association profile using placement delivery arrays

E Peter, KKK Namboodiri… - 2022 IEEE Information …, 2022 - ieeexplore.ieee.org
This work considers the coded caching problem with shared caches, where users share the
caches, and each user gets access only to one cache. The number of users connected to …

Stochastic coded caching with optimized shared-cache sizes and reduced subpacketization

A Malik, B Serbetci, P Elia - ICC 2022-IEEE International …, 2022 - ieeexplore.ieee.org
This work studies the K-user broadcast channel with Λ caches, when the association
between users and caches is random, ie, for the scenario where each user can appear …

The Optimal Rate Memory Tradeoff in Multi-Access Coded Caching: Large Cache Size

VK KP, BK Rai, T Jacob - 2023 IEEE Information Theory …, 2023 - ieeexplore.ieee.org
In this paper, we consider the (N, K, L) multi-access caching network where K users and K
caches are connected to a server with N files, each of size F bits, through a shared error-free …

An improved coded caching scheme for partially cooperative D2D networks

A Phatak, MK Varanasi - 2022 IEEE International Symposium …, 2022 - ieeexplore.ieee.org
A model of device-to-device (D2D) coded caching in which only a subset of users transmit
information during the D2D transmission process was recently introduced. Such networks …

Towards the Optimal Rate Memory Tradeoff in Caching With Coded Placement

VK KP, BK Rai, T Jacob - IEEE Transactions on Information …, 2022 - ieeexplore.ieee.org
The idea of coded caching for content distribution networks was introduced by Maddah-Ali
and Niesen, who considered the canonical cache network in which a server with files …