.png){kind=icon}
返回
A Novel Centralized Coded Caching Scheme With Coded Prefetching
.png){kind=icon}
PRE
AI
DOI：10.1109/JSAC.2018.2844959.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
For the caching problem, when the number of files is no larger than that of users, the best known rate-memory region is achieved by memory sharing between the rate-memory pairs obtained by three schemes: the scheme proposed by Yu et al., the scheme proposed by Gomez-Vilardebo, and the scheme proposed by Tian and Chen. While the first two schemes operate on the binary field, the Tian-Chen scheme makes use of a finite field of order 2(m) with, in some situations, m >= K log(2) (N) for a caching systems with K users and N files. The practical implications of this increase in the size of the field are equivalent to an increase, by a factor of in, in the number of suhfile partitions required. We propose a novel caching scheme that approaches the rate-memory region achieved by the Tian-Chen scheme as the number of users in the system increases, which only requires a field of order 2(2).
Keyword:
Centralized coded caching
network coding
index coding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
17.2
论文数:
6.4K
被引数:
3.1W
机构
引用论文
分享收藏Positive and Negative Feedback Mechanisms in the Neural Regulation of Cardiovascular Function in Healthy and Spinal Cord–Injured Humans.png)
Circulation
OAAI
CirculationIF0
OAAI分享收藏Fundamental Limits of Coded Caching: Improved Delivery Rate-Cache Capacity Tradeoff编码缓存的基本限制: 提高交付速率-缓存容量权衡OAAI
OAAI分享收藏
查看更多内容