Constructions of Coded Caching Schemes With Flexible Memory Size

Coded caching scheme recently has become quite popular in the wireless network, since the maximum transmission amount R reduces effectively during the peak-traffic times. To realize a coded caching scheme, each file must be divided into F packets, which usually increases the computation complexity of a coded caching scheme. So we prefer to design a scheme with R and F as small as possible in practice. However, there exists a tradeoff between R and F. In this paper, we generalize the schemes constructed by Shangguan et al. (IEEE TRANSACTIONS ON INFORMATION THEORY, 64, 5755-5766, 2018) and Yan et al. (IEEE TRANSACTIONS ON INFORMATION THEORY 63, 5821-5833, 2017), respectively. These two classes of schemes have a wider range of application due to the more flexible memory size than the original ones. By comparing with the previous known deterministic schemes, our new schemes have advantages on R or F.