Metraipolis › archive › dc_e6d4ef409126
Hotplug Coded Caching: Embedding the YMA and Interference Elimination Schemes via Reed--Muller Codes — arXiv:2611.05772
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.05772
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:28:54.300Z
- SHA-256 of the archived text
07ef23af452824653a69d38654740f812db837645f652028113a42012bfdec20- Stable URL of this page
https://metraipolis.com/documento/dc_e6d4ef409126
How to cite
Hotplug Coded Caching: Embedding the YMA and Interference Elimination Schemes via Reed--Muller Codes — arXiv:2611.05772 — arXiv (en), https://arxiv.org/abs/2611.05772 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e6d4ef409126 (Metraipolis archive dc_e6d4ef409126, sha256 07ef23af452824653a69d38654740f812db837645f652028113a42012bfdec20)
BibTeX
@misc{dce6d4ef409126,
title = {Hotplug Coded Caching: Embedding the YMA and Interference Elimination Schemes via Reed--Muller Codes — arXiv:2611.05772},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.05772},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e6d4ef409126; sha256 07ef23af452824653a69d38654740f812db837645f652028113a42012bfdec20},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05772. 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<K$ users is active in the delivery phase. We recently showed that (i) under uncoded placement, offline users cause a strict load penalty at intermediate memory sizes, so that coded placement is needed; and (ii) for $AM\leq N$, every classical scheme with row-wise placement, including the scheme of Gomez-Vilardebo (GV), can be embedded in a Reed-Solomon code, which removes the penalty. In this note, we show that every point of the scheme of Yu, Maddah-Ali and Avestimehr (YMA) for a classical system with $A$ users is achievable in the hotplug model for every $K\geq A$. Each user is associated with a hyperplane and each file with a homogeneous polynomial; each user caches the restriction of the polynomial to its hyperplane, and the subfiles seen by the active users are the values of the polynomial at the points where their hyperplanes meet. This is a projective Reed-Muller code, which reduces to the Reed-Solomon code when each subfile is cached by one user. We then show, by an existence argument, that every classical scheme whose cache is a linear compression of the Maddah-Ali-Niesen cache and whose correctness holds for generic coefficients can also be embedded over a sufficiently large field; this includes the interference elimination (IE) schemes of Tian and Chen. These embeddings complement the Reed-Solomon one, which allows any row-wise placement and any delivery. Together with past work, our results show that every point attained by a GV, YMA or IE scheme ($N\leq A$ for IE), and every corner point of the linear tradeoff for $A=N=3$, is achievable in the hotplug model with a load that does not depend on $K$. Whether the optimal hotplug tradeoff depends only on $A$ remains open, but these results support a positive answer. 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.05772 — 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-05T18:18:48.965Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).