论文标题
通过线性子包装的编码缓存的PDA的提升构造
Lifting Constructions of PDAs for Coded Caching with Linear Subpacketization
论文作者
论文摘要
编码缓存是一种利用多播和编码机会来实现缓存网络中更好的速率记忆折衷方案的技术。编码缓存中的关键参数是子包装，这是要将文件分为编码目的的零件数。原始的Maddah-Ali-niesen计划的订单最佳速率与用户数量成倍增长。相比之下，使用放置递送阵列（PDA）设计的编码缓存中的放置和交付方案可以具有线性子包装件，并具有损失的损失。在这项工作中，我们通过提升提出了几种有效PDA的构造，其中通过另一个PDA替换每个条目来扩展基本PDA。通过提出和使用Blackburn兼容PDA的概念，我们可以随着编码增长的增加提供多个提升结构。我们将构建的编码缓存方案与其他现有方案进行比较，以中等程度的用户数量，并表明所提出的构造用途广泛，并在低子封装下实现了良好的利率记忆折衷。
Coded caching is a technique where multicasting and coding opportunities are utilized to achieve better rate-memory tradeoff in cached networks. A crucial parameter in coded caching is subpacketization, which is the number of parts a file is to be split into for coding purposes. The original Maddah-Ali-Niesen scheme has order-optimal rate at a subpacketization growing exponentially with the number of users. In contrast, placement and delivery schemes in coded caching, designed using placement delivery arrays (PDAs), can have linear subpacketization with a penalty in rate. In this work, we propose several constructions of efficient PDAs through lifting, where a base PDA is expanded by replacing each entry by another PDA. By proposing and using the notion of Blackburn-compatibility of PDAs, we provide multiple lifting constructions with increasing coding gains. We compare the constructed coded caching schemes with other existing schemes for moderately high number of users and show that the proposed constructions are versatile and achieve a good rate-memory tradeoff at low subpacketizations.
