2022/01/22 by K. K. Krishnan Namboodiri, Namboodiri, K. K. Krishnan, B. Sundar Rajan +1
Computer Science · Engineering · #Advanced Wireless Network Optimization #Caching and Content Delivery #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.2201.09127
openalex publication_date 2022/01/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The multi-access variant of the coded caching problem with N files, K users and K caches, where each user has access to L neighbouring caches in a cyclic wrap-around manner, is considered. A cut-set based lower bound on the optimal rate-memory trade-off of the multi-access coded caching (MACC) scheme is derived. Furthermore, an improved lower bound on the optimal rate-memory trade-off of the MACC scheme is derived using non-cut-set arguments. The improved lower bound is tighter than the previously known lower bounds for the same setting.