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 …

Hachem et al. formulated a multiaccess coded caching model which consists of a central
server connected to K users via an error-free shared link, and K cache-nodes. Each cache …

This paper formulates the multi-access coded caching (MACC) problem under the two-
dimensional (2D) topology, which is a generalization of the one-dimensional (1D) MACC …

This paper studies a multiaccess coded caching (MACC) where the connectivity topology
between the users and the caches can be described by a class of combinatorial designs …

Coded distributed computing (CDC) is a new technique proposed with the purpose of
decreasing the intense data exchange required for parallelizing distributed computing …

We consider a variant of the coded caching problem where users connect to two types of
caches, called private and access caches. The problem setting consists of a server with a …

Recently, Muralidhar et al. proposed a novel multi-access system model where each user is
connected to multiple caches in a manner that follows the well-known combinatorial …

This work studies the coded caching problem in a setting where users can access a private
cache of their own along with a shared cache. The setting consists of a server connected to …

We consider a coded caching system in which some users are offline at the time of delivery.
Such systems are called hotplug coded caching systems\cite {MT2022},\cite {MT2023}. A …

This paper studies a novel multi-access coded caching (MACC) model in the two-
dimensional (2D) topology, which is a generalization of the one-dimensional (1D) MACC …