.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Coded caching
PDAs
sub-packetization
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSave
View more