Work

Improved multi-access coded caching schemes from maximal cross resolvable designs

Year: 2025

Type: article

Abstract: In multi-access coded caching (MACC) schemes, most research assumes that the users access $ z $ continuous caches by the way of a cyclic wrap-around user-to-cache association. Recently, N. Das and B. S. Rajan identify a class of user-to-cache association bipartite graphs, which achieves either a lower transmission rate or subpacketization level than all other existing MACC schemes using a cyclic wrap-around user-to-cache association. In this paper, we define a class of user-to-cache association matrix, and using the matrix, we improve the MACC schemes proposed by N. Das and B. S. Rajan in [2]. The improved schemes can achieve a lower transmission rate than the original scheme of [2] with the same subpacketization level under some cases.

Source: Advances in Mathematics of Communications

DOI: 10.3934/amc.2025021

Authors: Gang Wang, Yannan Li, You Gao, Minyao Niu

Institutions: Civil Aviation University of China, Tianjin University of Commerce

Language: English

Topic: Caching and Content Delivery

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funders: National Natural Science Foundation of China, Civil Aviation University of China, Natural Science Foundation of Tianjin City, Fundamental Research Funds for the Central Universities

Award: G6786543164