.png){kind=icon}
返回
Multi-Access Coded Caching Scheme With Linear Sub-Packetization Using PDAs
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2021.3116229.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider multi-access coded caching problem introduced by Hachem et.al., where each user has access to L neighboring caches in a cyclic wrap-around fashion. We focus on the deterministic schemes for a specific class of multi-access coded caching problem based on the concept of Placement Delivery Array (PDA). We construct new PDAs which specify the delivery scheme for the specific class of multi-access coded caching problem discussed in this paper. For the proposed scheme, the coding gain is larger than that of the state-of-the-art for some regimes while the sub-packetization level varies only linearly with the number of users. Hence, we achieve a lower transmission rate with the least sub-packetization level compared to the existing schemes.
Keyword:
Coded caching
PDAs
sub-packetization
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
.png){kind=icon}
分享收藏Fundamental Limits of Caching: Improved Rate-Memory Tradeoff With Coded Prefetching缓存的基本限制: 通过编码预取改进速率-内存权衡
OAAI
OAAI分享收藏
查看更多内容