Multi-Access Coded Caching Scheme With Linear Sub-Packetization Using PDAs

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.

Automated summary

In this paper, we focus on a specific class of multi-access coded caching problem and construct new Placement Delivery Arrays (PDAs) to achieve higher coding gain and lower transmission rate. The proposed scheme shows improved performance compared to existing schemes, with a linear increase in sub-packetization level with the number of users.