A New Coded Caching Scheme via Cartesian Product Method

Coded caching stores popular files in local caches, which is an effective method for decreasing network traffic during peak hours. Yan et al. put forward a combinatorial structure named placement delivery array (PDA), which is used to design coded caching schemes with uncoded placement and one-shot delivery. Recently, Wang et al. constructed an
$mK_{1}$
- user PDA by using the
$m$
-fold Cartesian product of a special
$K_{1}$
-user PDA called base PDA. In this paper, we first construct a new base PDA under the cyclic placement, then by using the Cartesian product method, a new coded caching scheme is attained, which is applicable to arbitrary quantity of users and memory ratio. Performance analyses show that the new scheme performs significantly better than previous schemes in terms of subpacketization or transmission load.