.png){kind=icon}
.png){kind=icon}
Return
Coded Caching Schemes With Linear Subpacketizations
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2021.3062667.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In coded caching system we prefer to design a coded caching scheme with low subpacketization and small transmission rate (i.e., the low implementation complexity and the efficient transmission during the peak traffic times). Placement delivery arrays (PDA) can be used to design code caching schemes. In this article we propose a framework of constructing PDAs via Hamming distance. As an application, two classes of coded caching schemes with linear subpacketizations and small transmission rates are obtained.
Keywords:
Handheld computers
Servers
Manganese
Hamming distance
Complexity theory
Arrays
Technological innovation
Coded caching scheme
placement delivery array
Hamming distance
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W