A novel transformation approach of shared-link coded caching schemes for multiaccess networks
This paper considers the multiaccess coded caching systems formulated by Hachem et al.,
including a central server containing files connected to cache-less users through an error …
including a central server containing files connected to cache-less users through an error …
Multi-access coded caching scheme with linear sub-packetization using PDAs
We consider multi-access coded caching problem introduced by Hachem et. al., where each
user has access to neighboring caches in a cyclic wrap-around fashion. We focus on the …
user has access to neighboring caches in a cyclic wrap-around fashion. We focus on the …
Structured index coding problem and multi-access coded caching
Index coding and coded caching are two active research topics in information theory with
strong ties to each other. Motivated by the multi-access coded caching problem, we study a …
strong ties to each other. Motivated by the multi-access coded caching problem, we study a …
On the optimal memory-load tradeoff of coded caching for location-based content
Caching at the wireless edge nodes is a promising way to boost the spatial and spectral
efficiency, for the sake of alleviating networks from content-related traffic. Coded caching …
efficiency, for the sake of alleviating networks from content-related traffic. Coded caching …
Multiaccess coded caching with private demands
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 …
server connected to K users via an error-free shared link, and K cache-nodes. Each cache …
Coded caching for two-dimensional multi-access networks
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 …
dimensional (2D) topology, which is a generalization of the one-dimensional (1D) MACC …
Coded Caching Schemes for Multiaccess Topologies via Combinatorial Design
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 …
between the users and the caches can be described by a class of combinatorial designs …
Improved lower bounds for multi-access coded caching
The multi-access variant of the coded caching problem with files, users and caches, where
each user has access to neighbouring caches in a cyclic wrap-around manner, is …
each user has access to neighbouring caches in a cyclic wrap-around manner, is …
Multi-access coded caching with demand privacy
The demand private coded caching problem in a multi-access network with K users and K
caches, where each user has access to L neighbouring caches in a cyclic wraparound …
caches, where each user has access to L neighbouring caches in a cyclic wraparound …
Multi-access coded caching with secure delivery
The multi-access variant of the coded caching problem in the presence of external
wiretappers is investigated. A multiaccess coded caching scheme with K users, K caches …
wiretappers is investigated. A multiaccess coded caching scheme with K users, K caches …