论文标题
使用矩阵的设计和电路共享缓存编码的缓存方案
Shared Cache Coded Caching Schemes Using Designs and Circuits of Matrices
论文作者
论文摘要
在本文中，我们研究了共享的缓存编码缓存（SC-CC）：一组缓存服务为较大的用户服务；每个用户访问一个缓存，并且缓存可能为许多用户提供服务。对于这个问题，在未编码的放置下，Parrinello，ünsal和Elia显示出最佳的SC-CC方案，其中子包装水平取决于缓存的数量。我们显示了一个SC-CC方案，其中子包装级别不直接取决于用户或缓存的数量；可以为固定的子包装级别容纳任意数量的缓存和用户。此外，可以添加新的缓存，而无需重新进行现有缓存的放置。我们表明，鉴于允许子包装水平的上限，我们的SC-CC方案可能比其他相关的SC-CC方案较低。我们的计划是使用矩阵和设计构建的。可以从有限场上的矩阵获得基质。我们计划的放置是由矩阵构建的设计决定的；从矩阵获得的矩形电路和设计用于决定输送。
In this paper, we study shared cache coded caching (SC-CC): a set of caches serves a larger set of users; each user access one cache, and a cache may serve many users. For this problem, under uncoded placement, Parrinello, Ünsal, and Elia showed an optimal SC-CC scheme, in which the subpacketization level depends upon the number of caches. We show an SC-CC scheme where the subpacketization level does not directly depend upon the number of users or caches; any number of caches and users can be accommodated for a fixed subpacketization level. Furthermore, new caches can be added without re-doing the placement of the existing caches. We show that given an upper limit on the allowable subpacketization level, our SC-CC scheme may achieve a lesser rate than other relevant SC-CC schemes. Our scheme is constructed using matrices and designs. A matroid can be obtained from a matrix over a finite field; the placement of our scheme is decided by a design constructed from a matrix; the circuits of a matroid obtained from the matrix and the design is used to decide the delivery.
