Multi-Access Coded Caching Schemes From Cross Resolvable Designs

We present a novel caching and coded delivery scheme for a multi-access network where multiple users can have access to the same cache (shared cache) and multiple caches can be accessed by the same user. This scheme is obtained from resolvable designs satisfying certain conditions which we call cross resolvable designs. To be able to compare different multi-access coded schemes with different number of users we normalize the rate of the schemes by the number of users served. Based on this per-user-rate we show that our scheme performs better than the well known Maddah-Ali - Niesen (MaN) scheme and the recently proposed (Multi-access coded caching: gains beyond cache-redundancy by Serbetci, Parrinello and Elia) SPE scheme. It is shown that the resolvable designs from affine planes are cross resolvable designs and our scheme based on these performs better than the MaN scheme for large memory size cases. The exact size beyond which our performance is better is also presented. The SPE scheme considers only the cases where the product of the number of users and the normalized cache size is 2, whereas the proposed scheme allows different choices depending on the choice of the cross resolvable design.

Automated summary

This paper introduces a novel caching and coded delivery scheme for multi-access networks, which outperforms existing schemes like MaN and the SPE scheme, particularly in large memory size cases. By normalizing the per-user rate of different schemes, it is shown that the proposed scheme performs better, allowing for different choices based on cross resolvable designs.