Fundamental limits of combinatorial multi-access caching
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 …
each user is connected to multiple caches in a manner that follows a generalized …
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 …
Coded Caching for Two-Dimensional Multi-Access Networks With Cyclic Wrap Around
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 …
dimensional (2D) topology, which is a generalization of the one-dimensional (1D) MACC …
Coded caching schemes for two-dimensional caching-aided ultra-dense networks
Coded caching technique is an efficient approach to reduce the transmission load in
networks. In this paper, we consider a new widespread caching system called two …
networks. In this paper, we consider a new widespread caching system called two …
Multi-antenna Coded Caching with Combinatorial Multi-access Networks
We study the combinatorial multi-access coded caching problem, introduced by Muralidhar
et al. with a single antenna at the server PN Muralidhar, D. Katyal, and BS Rajan," Maddah …
et al. with a single antenna at the server PN Muralidhar, D. Katyal, and BS Rajan," Maddah …
Combinatorial multi-access coded caching: Improved rate-memory trade-off with coded placement
KKK Namboodiri, BS Rajan - IEEE Transactions on Information …, 2024 - ieeexplore.ieee.org
This work considers the combinatorial multi-access coded caching problem introduced in
the recent work by Muralidhar et al.(2021). The problem setting consists of a central server …
the recent work by Muralidhar et al.(2021). The problem setting consists of a central server …
D2D Coded Caching Schemes for Multiaccess Networks with Combinatorial Access Topology
BS Rajan - arXiv preprint arXiv:2501.10756, 2025 - arxiv.org
This paper considers wireless device-to-device (D2D) coded caching in a multiaccess
network, where the users communicate with each other and each user can access multiple …
network, where the users communicate with each other and each user can access multiple …
Multi-access coded caching schemes from maximal cross resolvable designs
We study the problem of multi-access coded caching (MACC): a central server has N files, K
(K≤ N) caches each of which stores M out of the N files, K users each of which demands …
(K≤ N) caches each of which stores M out of the N files, K users each of which demands …
Optimal memory-rate tradeoff for secure multi-access coded caching: the case of largest access number
This work addresses the secure multi-access coded caching (SMACC) problem involving N
files, K users, and K caches, where each user can access L consecutive caches in a cyclic …
files, K users, and K caches, where each user can access L consecutive caches in a cyclic …