Fundamental Limits of Coded Caching with Fixed Subpacketization

TL;DR

This paper addresses the fundamental limit of coded caching with fixed subpacketization by formulating a general lower bound on the optimal transmission load R^*(F) under identically uncoded placement and one-shot delivery using the Placement Delivery Array (PDA) framework. The authors show that this bound subsumes known optimal schemes, including the Maddah-Ali–Niesen (MN) scheme and bipartite graph PDAs, and prove that the partition PDA achieves the optimal rate-subpacketization trade-off under the stated placement rule. They provide a detailed combinatorial proof by analyzing ordered subsets and their intersections, demonstrating that the partition scheme is optimal in this setting and offering asymptotic optimality results for certain parameter regimes (e.g., q≥2 as m grows, exact at q=2). The results yield practical design guidelines for achieving low transmission load with finite subpacketization and extendable insights to related network settings.

Abstract

Coded caching is a promising technique to create coded multicast opportunities for cache-aided networks. By splitting each file into $F$ equal packets (i.e., the subpacketization level $F$) and letting each user cache a set of packets, the transmission load can be significantly reduced via coded multicasting. It has been shown that a higher subpacketization level could potentially lead to a lower transmission load, as more packets can be combined for efficient transmission. On the other hand, a larger $F$ indicates a higher coding complexity and is problematic from a practical perspective when $F$ is extremely large. Despite many works attempting to design coded caching schemes with low subpacketization levels, a fundamental problem remains open: What is the minimum transmission load given any fixed subpacketization level? In this paper, we consider the classical cache-aided networks with identically uncoded placement and one-shot delivery strategy, and investigate the fundamental trade-off between the transmission load and the subpacketization level. We propose a \emph{general} lower bound on the transmission load for any fixed subpacketization by reformulating the centralized coded caching schemes via the combinatorial structure of the corresponding placement delivery array. The lower bound also recovers existing optimality results for the bipartite graph scheme (including the well-known Maddah-Ali and Niesen (MN) scheme and the conjugate MN scheme) as well as the grouping bipartite graph scheme. Furthermore, by carefully exploiting the combinatorial structure and computing the union size of sorted sets, we establish a new optimality result, i.e., the partition scheme can achieve the optimal rate-subpacketization trade-off.

Figures (2)

• Figure 1: A $(K,M,N)$ centralized caching system
• Figure 2: The ratios $\mu$ of $S^{*}$ and our derived $S$ with $q=3,4,5$.

Theorems & Definitions (22)

• Definition 1
• Lemma 1
• Example 1
• Lemma 2
• Example 2
• Theorem 1
• proof
• Remark 1
• Remark 2
• Theorem 2