The multi-access variant of the coded caching problem with NN files, KK users and KK caches, where each user has access to LL 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. Further, for cache memory M≤(N−K+L)/KM\leq {(N-K+L)}/{K} , an achievable scheme makes use of coded placement is presented. By matching with the improved lower bound, the scheme is shown to be optimal when N≤KN\leq K . Also, lower bounds on the optimal rate-memory trade-off of the MACC scheme incorporating secure delivery and secrecy conditions are derived.

中文翻译：

---

改进了多路访问编码缓存的下限


考虑了具有 NN 文件、KK 用户和 KK 缓存的编码缓存问题的多访问变体，其中每个用户都可以以循环环绕方式访问 LL 相邻缓存。导出了多路访问编码缓存（MACC）方案的最佳速率-内存权衡的基于割集的下界。此外，使用非割集参数导出了 MACC 方案的最佳速率-内存权衡的改进下界。对于相同设置，改进的下限比先前已知的下限更严格。此外，对于高速缓冲存储器M≤(N−K+L)/KM\leq {(N-K+L)}/{K}，提出了利用编码放置的可实现方案。通过与改进的下界匹配，当 N≤KN\leq K 时，该方案是最优的。此外，还得出了结合安全传递和保密条件的 MACC 方案的最佳速率-内存权衡的下限。