Coded Caching with Polynomial Subpacketization

2020/01/20 by Song, Wentu, Cai, Kui, Shi, Long
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2001.07020

Abstract

Consider a centralized caching network with a single server and K users. The server has a database of N files with each file being divided into F packets (F is known as subpacketization), and each user owns a local cache that can store (M)/(N) fraction of the N files. We construct a family of centralized coded caching schemes with polynomial subpacketization. Specifically, given M, N and an integer n≥ 0, we construct a family of coded caching schemes for any (K,M,N) caching system with F=O(Kⁿ⁺¹). More generally, for any t∈\1,2,⋯,K-2\ and any integer n such that 0≤ n≤ t, we construct a coded caching scheme with (M)/(N)=(t)/(K) and F≤ K\binom(1-(M)/(N))K+nn.

Related

• Coded Caching with Linear Subpacketization is Possible using\n Ruzsa-Szem 'eredi Graphs
• A New Construction Structure on Coded Caching with Linear Subpacketization: Non-Half-Sum Disjoint Packing
• Coded Caching based on Combinatorial Designs
• Coded Caching Schemes with Reduced Subpacketization from Linear Block Codes
• Symmetric uncoded caching schemes with low subpacketization levels