Multi-access Coded Caching Scheme with Linear Sub-packetization using PDAs
Abstract
We consider multi-access coded caching problem introduced by Hachem et.al., where each user has access to 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 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 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.
Cite
@article{arxiv.2102.06616,
title = {Multi-access Coded Caching Scheme with Linear Sub-packetization using PDAs},
author = {Shanuja Sasi and B. Sundar Rajan},
journal= {arXiv preprint arXiv:2102.06616},
year = {2021}
}
Comments
Presentation improved with enhanced figures and illustrative examples added to the previous version. A shorter version submitted to ISIT2021. 13 pages, 3 figures and 1 table