论文标题
用于多访问编码的缓存的改进的下限
An Improved Lower Bound for Multi-Access Coded Caching
论文作者
论文摘要
$ n $文件，$ k $用户和$ k $缓存的编码缓存问题的多访问变体，每个用户都可以以循环包裹的方式访问$ l $邻近的卡希斯。得出了基于切割的剪切下限，以多访问编码缓存（MACC）方案的最佳速率内存权衡。此外，使用非cut-set参数得出了MACC方案最佳速率内存权衡的改进下限。在同一设置中，改进的下限比以前已知的下限更紧。
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.
