New optimal trade-off point for coded caching systems with limited cache size

2023/10/11 by Yinbin Ma, Ma, Yinbin, Daniela Tuninetti +1
Computer Science · Engineering · #Advanced Wireless Network Optimization #Caching and Content Delivery #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.2310.07686

openalex publication_date 2023/10/11 · openalex created_date 2023/10/13 · openalex updated_date 2026/07/28

Abstract

This paper presents a new achievable scheme for coded caching systems with N files, K=N users, and cache size M=1/(N-1). The scheme employs linear coding during the cache placement phase, and a three-stage transmissions designed to eliminate interference in the delivery phase. The achievable load meets a known converse bound, which impose no constraint on the cache placement, and is thus optimal. This new result, together with known inner and outer bounds, shows optimality of linear coding placement for M ≤ 1/(N-1) when K=N≥ 3. Interestingly and surprisingly, the proposed scheme is relatively simple but requires operations on a finite field of size at least 3.

Related

• A Novel Scheme for Coded Caching with Coded Placement in Small Memory Regime
• The Exact Rate Memory Tradeoff for Small Caches with Coded Placement
• Fundamental Limits of Coded Caching: Improved Delivery Rate-Cache Capacity Trade-off
• Fundamental Limits of Coded Caching: The Memory Rate Pair (K-1-1/K,\n 1/(K-1))
• The Exact Rate Memory Tradeoff for Large Caches with Coded Placement