论文标题
改进的多访问编码缓存，并没有编码
An Improved Multi-access Coded Caching with Uncoded Placement
论文作者
论文摘要
在这项工作中，我们考虑了一个众所周知的编码缓存问题的略有变体，称为多访问编码的缓存问题，每个用户都可以以环形包裹的方式访问$ z $相邻的缓存。在未编码的放置限制下，我们为此问题提供了一个安置和交付方案。我们的工作是对B. Serbetci，E。Parrinello和P. Elia的“多访问编码缓存：超越高速缓存的收益”中考虑的一个案例的概括。确切地说，当我们的方案专门为$ z = \ frac {k-1} {kγ} $（对于任何$kγ$）时，$ k $是用户的数量，而$γ$是标准化的高速缓存尺寸，我们表明我们的结果与他们的结果相吻合。我们表明，对于这项工作中考虑的情况，我们的计划优于K. S. Reddy和N. Karamchandani在“对多访问编码的加缓存的费率记忆折衷”中提出的计划，除了该论文中考虑了一些特殊案例。我们还表明，对于$ z = k-1 $，我们的计划可实现最佳传输速率。
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 γ}$, for any $K γ$, where $K$ is the number of users and $γ$ 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.
