Metraipolis › archive › dc_11265d7cd644
Hotplug Coded Caching: Uncoded versus Row-Wise Coded Placements — arXiv:2611.03045
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.03045
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:51:50.704Z
- SHA-256 of the archived text
d4ba73e99fa9dc766ee878a0f90cb504000e5923a6290a0c35df416527cfb21e- Stable URL of this page
https://metraipolis.com/documento/dc_11265d7cd644
How to cite
Hotplug Coded Caching: Uncoded versus Row-Wise Coded Placements — arXiv:2611.03045 — arXiv (en), https://arxiv.org/abs/2611.03045 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_11265d7cd644 (Metraipolis archive dc_11265d7cd644, sha256 d4ba73e99fa9dc766ee878a0f90cb504000e5923a6290a0c35df416527cfb21e)
BibTeX
@misc{dc11265d7cd644,
title = {Hotplug Coded Caching: Uncoded versus Row-Wise Coded Placements — arXiv:2611.03045},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.03045},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_11265d7cd644; sha256 d4ba73e99fa9dc766ee878a0f90cb504000e5923a6290a0c35df416527cfb21e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03045. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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\leq 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\leq 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\leq N\leq A$, the scheme of Gomez-Vilardebo (GV) is RWP optimal for $AM\leq 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\leq 1$. Hence, the Reed-Solomon embeddings of these schemes are optimal among embedded RWP schemes. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno). Categorie arXiv: Information Theory (cs.IT) ; Signal Processing (eess.SP). Pagina del lavoro: https://arxiv.org/abs/2611.03045 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T18:15:52.832Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).