论文标题
带有线性子包装的编码缓存方案及其应用于多访问编码的缓存
A Coded Caching Scheme with Linear Sub-packetization and its Application to Multi-Access Coded Caching
论文作者
论文摘要
本文通过引入一个新的编码缓存方案来解决集中式编码的缓存系统中用户数量的指数增加的问题，灵感来自对称相邻的连续侧面信息索引编码问题。该方案具有安置策略，其中所需的子包装数量仅与用户数量线性增长，而没有限制文件大小，而交付策略则可以立即解释。此外，研究了新的交付方案在多访问编码的缓存设置中的应用，并提出了该方向的一些结果。特别是，在多访问设置的情况下，对于可提供最佳速率 - 记忆折衷特征的情况，这表明新的交付方案可实现最佳或近乎最佳的速率。
This paper addresses the problem of exponentially increasing sub-packetization with the number of users in a centralized coded caching system by introducing a new coded caching scheme inspired by the symmetric neighboring consecutive side information index coding problem. The scheme has a placement policy where the number of sub-packets required grows only linearly with the number of users, with no restriction on file size, and a delivery policy which is instantaneously decodable. Further, an application of the new delivery scheme in a multi-access coded caching set-up is studied and a few results in that direction are presented. In particular, in the multi-access set-up, for cases where optimality rate-memory trade-off characterizations are available, it is shown that the new delivery scheme achieves optimal or near-optimal rates.
