We consider multi-access coded caching problem introduced by Hachem et.al., where each user has access to $L$ neighboring caches in a cyclic wrap-around fashion. We focus on the deterministic schemes for a specific class of multi-access coded caching problem based on the concept of PDA. We construct new PDAs which specify the delivery scheme for the specific class of multi-access coded caching problem discussed in this paper. For the proposed scheme, the coding gain is larger than that of the state-of-the-art while the sub-packetization level varies only linearly with the number of users. Hence, we achieve a lower transmission rate with the least sub-packetization level compared to the existing schemes.

翻译：我们考虑Hachem et.al提出的多存取编码缓存问题,每个用户都可以以环环包装方式获得$L的邻接缓存。我们侧重于基于PDA概念的特定类别的多存取编码缓存问题的确定性计划。我们建造了新的PDA系统,为本文讨论的多存取编码缓存问题的特定类别具体规定交付计划。对于拟议的计划,编码收益大于最新数据,而次包装水平则与用户数量不同。因此,我们实现了与现有计划相比最低分包存水平的较低传输率。