Improved Multi-access Coded Caching Schemes from Cross Resolvable Designs
Pooja Nayak Muralidhar, Digvijay Katyal, B. Sundar Rajan

TL;DR
This paper generalizes existing multi-access coded caching schemes based on Cross Resolvable Designs, leading to improved rate-per-user performance in caching networks.
Contribution
It introduces a generalized framework for multi-access coded caching schemes that enhances rate-per-user using resolvable design principles.
Findings
Achieved improved rate-per-user in caching schemes.
Extended the class of resolvable designs applicable to caching.
Demonstrated theoretical performance gains over previous schemes.
Abstract
Recently multi-access coded caching schemes with number of users different from the number of caches obtained from a special case of resolvable designs called Cross Resolvable Designs (CRDs) have been reported and a new performance metric called rate-per-user has been introduced \cite{KNRarXiv}. In this paper we present a generalization of this work resulting in multi-access coded caching schemes with improved rate-per-user.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
