Rate-memory trade-off for multi-access coded caching with uncoded placement
KS Reddy, N Karamchandani - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
We study a multi-access variant of the popular coded caching framework, which consists of a
central server with a catalog of N files, K caches with limited memory M, and K users such …
central server with a catalog of N files, K caches with limited memory M, and K users such …
Coded caching with shared caches: Fundamental limits with uncoded prefetching
E Parrinello, A Ünsal, P Elia - arXiv preprint arXiv:1809.09422, 2018 - arxiv.org
The work identifies the fundamental limits of coded caching when the K receiving users
share {\Lambda} $\leq $ K helper-caches, each assisting an arbitrary number of different …
share {\Lambda} $\leq $ K helper-caches, each assisting an arbitrary number of different …
An improved multi-access coded caching with uncoded placement
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 …
multi-access coded caching problem, where each user has access to $ z $ neighboring …
Fundamental limits of coded caching: Improved delivery rate-cache capacity tradeoff
A centralized coded caching system, consisting of a server delivering N popular files, each
of size F bits, to K users through an error-free shared link, is considered. It is assumed that …
of size F bits, to K users through an error-free shared link, is considered. It is assumed that …
Coded caching with asymmetric cache sizes and link qualities: The two-user case
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 …
heterogeneous cache capacities at the users and private channels from the server to the …
Coded caching for a large number of users
We consider the coded caching problem with a central server containing N files, each of
length F bits, and K users, each equipped with a cache of capacity MF bits. We assume that …
length F bits, and K users, each equipped with a cache of capacity MF bits. We assume that …
Optimization of heterogeneous coded caching
AM Daniel, W Yu - IEEE Transactions on Information Theory, 2019 - ieeexplore.ieee.org
This paper aims to provide an optimization framework for coded caching that accounts for
various heterogeneous aspects of practical systems. An optimization theoretic perspective …
various heterogeneous aspects of practical systems. An optimization theoretic perspective …
Coded caching with heterogeneous cache sizes and link qualities: The two-user case
The centralized coded caching problem is studied under heterogeneous cache sizes and
channel qualities from the server to the users, focusing on the two-user case. A server …
channel qualities from the server to the users, focusing on the two-user case. A server …
Closing the gap for coded caching with distinct file sizes
Coded caching can exploit multicast opportunities even when multiple users request
different pieces of content, and thus can significantly reduce the backhaul requirement to …
different pieces of content, and thus can significantly reduce the backhaul requirement to …
Coded caching for files with distinct file sizes
Coded caching can exploit new multicast opportunities even when multiple users request
different pieces of content, and thus can significantly reduce the backhaul requirement for …
different pieces of content, and thus can significantly reduce the backhaul requirement for …