In this work, we consider a slight variant of well known coded caching problem, referred as multi-access coded caching problem, where each user has access to $z$ neighboring caches in a cyclic wrap-around way. We present a placement and delivery scheme for this problem, under the restriction of uncoded placement. Our work is a generalization of one of the cases considered in "Multi-access coded caching : gains beyond cache-redundancy" by B. Serbetci, E. Parrinello and P. Elia. To be precise, when our scheme is specialized to $z=\frac{K-1}{K \gamma }$, for any $K \gamma$, where $K$ is the number of users and $\gamma $ is the normalized cache size, we show that our result coincides with their result. We show that for the cases considered in this work, our scheme outperforms the scheme proposed in "Rate-memory trade-off for multi-access coded caching with uncoded placement" by K. S. Reddy and N. Karamchandani, except for some special cases considered in that paper. We also show that for $z= K-1$, our scheme achieves the optimal transmission rate.

中文翻译：

---

一种改进的具有未编码放置的多路访问编码缓存

在这项工作中，我们考虑了众所周知的编码缓存问题的一个轻微变体，称为多访问编码缓存问题，其中每个用户都可以以循环环绕的方式访问 $z$ 相邻缓存。在未编码放置的限制下，我们针对这个问题提出了一个放置和交付方案。我们的工作是 B. Serbetci、E. Parrinello 和 P. Elia 在“多访问编码缓存：超越缓存冗余的收益”中考虑的一种情况的概括。准确地说，当我们的方案专门用于 $z=\frac{K-1}{K \gamma }$ 时，对于任何 $K \gamma$，其中 $K$ 是用户数量，$\gamma $ 是归一化缓存大小，我们表明我们的结果与他们的结果一致。我们表明，对于这项工作中考虑的情况，我们的方案优于“