Hotplug Coded Caching: Uncoded versus Row-Wise Coded Placements
cs.IT, eess.SP, math.IT
Submitted: 2026-11-02
Updated: 2026-11-02
Comments: Submitted to ICC 2027
License: http://creativecommons.org/licenses/by/4.0/
The gist: In the hotplug coded caching model, K users fill their caches of size M as a function of N files, but only an unknown subset of A at most K users is active in the delivery phase.
Terminology
Abstract
In the hotplug coded caching model, K users fill their caches of size M as a function of N files, but only an unknown subset of A at most K users is active in the delivery phase. In all regimes where the optimal hotplug tradeoff is known, it depends only on A, not on K; whether this holds in general is open. We show that: (i) Under uncoded placement, YMA delivery with MAN placement, where offline users are assigned the demands of active users, is optimal. Hence, offline users cause a strict load penalty at intermediate memory sizes, while the MAN placement is optimal for every number of active users; (ii) Under row-wise placement (RWP), where each cache is a function of the user's own row of each file, every classical scheme can be embedded in a Reed-Solomon code. The resulting hotplug scheme has the tradeoff of the classical model with A users, for every A at most K: there is no load penalty, but the placement depends on K. We then derive a converse for RWP, which shows that: (a) for 2 at most N at most A, the scheme of Gomez-Vilardebo (GV) is RWP optimal for AM at most N/(N-1), which settles the RWP tradeoff for N=2; (b) YMA is RWP optimal at AM=N; and (c) for N=A=3, GV is RWP optimal for M at most 1. Hence, the Reed-Solomon embeddings of these schemes are optimal among embedded RWP schemes.
Sources
- The Exact Rate Memory Tradeoff for Small Caches with Coded Placement
- On Coded Caching Systems with Offline Users, with and without Demand Privacy against Colluding Users
- Characterizing Linear Memory-Rate Tradeoff of Coded Caching: The $(N,K)=(3,3)$ Case
Related papers
- The Gaussian Multiuser Channel Capacity Region
- The mathematical landscape of partial information decomposition: A comprehensive review of properties and measures
- Analytically Characterized Optimal Power Control for Signal-Level-Integrated Sensing, Computing and Communication in Federated Learning
- Information Spectrum Methods for Multiple-Access Channels--Part I: epsilon-Capacity Regions in the Mixed Gaussian Case
- Seed Recycling: Explicit Codes for Mixed Synchronization Errors Matching the Leading Term of the Gilbert--Varshamov Bound
- Second-Order Image Characterization with Distortion and Secrecy