期刊
IEEE TRANSACTIONS ON INFORMATION THEORY
卷 64, 期 4, 页码 3099-3120出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2018.2800059
关键词
Coded caching; resolvable designs; cyclic codes; subpacketization level
资金
- National Science Foundation [CCF-1718470, CCF-1320416, CCF-1149860]
- Division of Computing and Communication Foundations
- Direct For Computer & Info Scie & Enginr [1149860] Funding Source: National Science Foundation
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 (i.e., 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 paper, 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 obtain several schemes with subpacketization levels substantially lower than the basic scheme at the cost of an increased rate. Depending on the system parameters, our approach allows us to operate at various points on the subpacketization level vs. rate tradeoff.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据