A New Construction Structure on Coded Caching with Linear Subpacketization: Non-Half-Sum Latin Rectangle
Yongcheng Yang, Minquan Cheng, Kai Wan, and Giuseppe Caire

TL;DR
This paper introduces Non-Half-Sum Latin Rectangles to develop coded caching schemes with linear subpacketization that significantly reduce transmission load, approaching exponential scheme performance.
Contribution
It extends the NHSDP framework using NHSLR, enabling scalable subpacketization and lower transmission load in coded caching schemes.
Findings
Achieves linearly scalable subpacketization.
Reduces transmission load compared to existing linear schemes.
Approaches performance of exponential subpacketization schemes.
Abstract
Coded caching is recognized as an effective method for alleviating network congestion during peak periods by leveraging local caching and coded multicasting gains. The key challenge in designing coded caching schemes lies in simultaneously achieving low subpacketization and low transmission load. Most existing schemes require exponential or polynomial subpacketization levels, while some linear subpacketization schemes often result in excessive transmission load. Recently, Cheng et al. proposed a construction framework for linear coded caching schemes called Non-Half-Sum Disjoint Packing (NHSDP), where the subpacketization equals the number of users . This paper introduces a novel combinatorial structure, termed the Non-Half-Sum Latin Rectangle (NHSLR), which extends the framework of linear coded caching schemes from (i.e., the construction via NHSDP) to a broader scenario with…
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.
Taxonomy
TopicsCaching and Content Delivery · Advanced Data Storage Technologies · Network Traffic and Congestion Control
