Low subpacketization schemes for coded caching
Low subpacketization schemes for coded caching
复制标题
DOI：
10.1109/isit.2017.8007038
复制
发表时间：
2017-05
期刊：
影响因子：
--
通讯作者：
Li Tang;A. Ramamoorthy
中科院分区：
文献类型：
--
作者：
Li Tang;A. Ramamoorthy
编码的缓存是一种概括传统的缓存并有望大大减少缓存网络流量的技术。但是，基本的编码缓存方案要求将服务器中托管的每个文件分为非重叠子文件的大数字（称为子包装级别）。从实际的角度来看，这是有问题的，因为这意味着只有在文件的大小非常大的情况下才适用于先前的方案。在这项工作中，我们提出了基于称为可分离设计的组合结构的编码缓存方案。这些结构可以自然方式从线性块代码中获得，其发电机矩阵具有某些等级属性。我们证明了几种具有子包装水平的方案，这些方案呈指数小于基本方案。
Coded caching is a technique that generalizes conventional caching and promises significant reductions in traffic over caching networks. However, the basic coded caching scheme requires that each file hosted in the server be partitioned into a large number (called the subpacketization level) of non-overlapping subfiles. From a practical perspective, this is problematic as it means that prior schemes are only applicable when the size of the files is extremely large. In this work, we propose coded caching schemes based on combinatorial structures called resolvable designs. These structures can be obtained in a natural manner from linear block codes whose generator matrices possess certain rank properties. We demonstrate that several schemes with subpacketization levels that are exponentially smaller than the basic scheme can be obtained.