Coded Caching with Polynomial Subpacketization
Wentu Song, Kui Cai, and Long Shi

TL;DR
This paper introduces a family of centralized coded caching schemes with polynomial subpacketization, enabling scalable and efficient data distribution for large networks by controlling the subpacketization size.
Contribution
It presents novel coded caching schemes with polynomial subpacketization for any system parameters, improving scalability over previous exponential schemes.
Findings
Achieves polynomial subpacketization $F=O(K^{n+1})$ for caching systems.
Provides explicit constructions for schemes with various cache sizes.
Demonstrates improved scalability and efficiency in coded caching.
Abstract
Consider a centralized caching network with a single server and users. The server has a database of files with each file being divided into packets ( is known as subpacketization), and each user owns a local cache that can store fraction of the files. We construct a family of centralized coded caching schemes with polynomial subpacketization. Specifically, given , and an integer , we construct a family of coded caching schemes for any caching system with . More generally, for any and any integer such that , we construct a coded caching scheme with and .
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 · Cooperative Communication and Network Coding · Wireless Communication Networks Research
