# An Improved Lower Bound for Multi-Access Coded Caching

Source: [An Improved Lower Bound for Multi-Access Coded Caching](<https://www.sota2.com/research/paper/68fa58e61e209131ce9b20ee>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T15:34:35.509Z

Authors: K. K. Krishnan Namboodiri, B. Sundar Rajan

Published: 2022-01-22T20:52:19.000Z

## Abstract

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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2201.09127>)

[PDF](<https://arxiv.org/pdf/2201.09127.pdf>)