Multi-access Coded Caching from a New Class of Cross Resolvable Designs

TL;DR

This paper introduces a new class of cross resolvable designs for multi-access coded caching, demonstrating improved performance over existing schemes across all memory regimes.

Contribution

A novel class of cross resolvable designs is proposed, leading to multi-access coded caching schemes that outperform the Maddah-Ali-Niesen scheme universally.

Findings

New CRDs outperform Maddah-Ali-Niesen in all memory regimes.

Schemes show better rate-per-user metrics.

Comparison with other schemes confirms superior performance.

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.