A New Construction Structure on Multi-access Coded Caching with Linear Subpacketization: Cyclic Multi-Access Non-Half-Sum Disjoint Packing

2026-01-15

AI Summary

Existing multi-access coded caching schemes struggle to simultaneously achieve low transmission load and linear subpacketization complexity. This work proposes a novel combinatorial structure—Cyclic Multi-Access Non-Half-Sum Disjoint Packing (CMA-NHSDP)—which, for the first time, extends non-half-sum disjoint packings to the multi-access coded caching setting. The resulting scheme achieves linear subpacketization with respect to the number of users \(K\) while maintaining a reduced transmission load. Theoretical analysis and numerical evaluations demonstrate that, under certain parameter regimes, the proposed scheme not only significantly lowers the transmission load but also outperforms existing schemes that require exponential subpacketization.

Technology Category

• Search and Optimization: Combinatorial Optimization
• Constraint Satisfaction and Optimization: Distributed CSP/Optimization
• Cognitive Modeling & Cognitive Systems: Neural Spike Coding

Application Category

• Graph Algorithms and Modeling for the Web: Representation, reconstruction, and subgraph or motif discovery in Web-related graphs
• Security and Privacy: Large-scale security measurements
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems

Abstract

We consider the $(K,L,M,N)$ multi-access coded caching system introduced by Hachem et al., which consists of a central server with $N$ files and $K$ cache nodes, each of memory size $M$, where each user can access $L$ cache nodes in a cyclic wrap-around fashion. At present, several existing schemes achieve competitive transmission performance, but their subpacketization levels grow exponentially with the number of users. In contrast, schemes with linear or polynomial subpacketization always incur higher transmission loads. We aim to design a multi-access coded caching scheme with linear subpacketization $F$ while maintaining low transmission load. Recently, Cheng et al. proposed a construction framework for coded caching schemes with linear subpacketization (i.e., $F=K$) called non-half-sum disjoint packing (NHSDP). Inspired by this structure, we introduce a novel combinatorial structure named cyclic multi-access non-half-sum disjoint packing (CMA-NHSDP) by extending NHSDP to MACC system. By constructing CMA-NHSDP, we obtain a new class of multi-access coded caching schemes. Theoretical and numerical analyses show that our scheme achieves lower transmission loads than some existing schemes with linear subpacketization. Moreover, the proposed schemes achieves lower transmission load compared to existing schemes with exponential subpacketization in some case.

Problem

• multi-access coded caching
• linear subpacketization
• transmission load
• cyclic access
• coded caching

Innovation

• multi-access coded caching
• linear subpacketization
• non-half-sum disjoint packing
• cyclic wrap-around
• transmission load reduction