Multi-access Coded Caching from a New Class of Cross Resolvable Designs
Information Theory
2021-02-02 v1 math.IT
Abstract
Multi-access coded caching schemes from cross resolvable designs (CRD) have been reported recently \cite{KNRarXiv}. To be able to compare coded caching schemes with different number of users and possibly with different number of caches a new metric called rate-per-user was introduced and it was shown that under this new metric the schemes from CRDs perform better than the Maddah-Ali-Niesen scheme in the large memory regime. In this paper a new class of CRDs is presented and it is shown that the multi-access coded caching schemes derived from these CRDs perform better than the Maddah-Ali-Niesen scheme in the entire memory regime. Comparison with other known multi-access coding schemes is also presented.
Cite
@article{arxiv.2102.00400,
title = {Multi-access Coded Caching from a New Class of Cross Resolvable Designs},
author = {Pooja Nayak Muralidhar and B. Sundar Rajan},
journal= {arXiv preprint arXiv:2102.00400},
year = {2021}
}
Comments
10 pages, 4 tables and 9 figures