Metraipolis › archive › dc_bf724e4830ea
Recovery Set Structures and Service Rates of Codes Obtained by the Plotkin-type Construction — arXiv:2610.01900
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.01900
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T17:42:20.374Z
- SHA-256 of the archived text
7cba1c409f467d168ff4ae401cffd66d2ab2c906216e5b2952bacfece72b8427- Stable URL of this page
https://metraipolis.com/documento/dc_bf724e4830ea
How to cite
Recovery Set Structures and Service Rates of Codes Obtained by the Plotkin-type Construction — arXiv:2610.01900 — arXiv (en), https://arxiv.org/abs/2610.01900 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bf724e4830ea (Metraipolis archive dc_bf724e4830ea, sha256 7cba1c409f467d168ff4ae401cffd66d2ab2c906216e5b2952bacfece72b8427)
BibTeX
@misc{dcbf724e4830ea,
title = {Recovery Set Structures and Service Rates of Codes Obtained by the Plotkin-type Construction — arXiv:2610.01900},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.01900},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bf724e4830ea; sha256 7cba1c409f467d168ff4ae401cffd66d2ab2c906216e5b2952bacfece72b8427},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.01900. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In distributed storage systems, redundancy enables a single data object to be reconstructed using several disjoint groups of servers. The resulting service rate region (SRR) captures all combinations of object request rates that the system can support simultaneously without overloading any individual server. We analyze the SRR of binary codes obtained via the Plotkin-type construction. We demonstrate that each recovery set for an information object of the Plotkin-type code $\mathcal{C}_p$ induces a corresponding recovery set for the same data object characterized by the underlying code $\mathcal{C}$. Furthermore, by characterizing the recovery sets structure of $\mathcal{C}_p$ in terms of the recovery set structure of $\mathcal{C}$, we identify the additional recovery sets introduced by this construction. Using the associated recovery hypergraphs, we establish bounds on the SRRs of $\mathcal{C}_p$ and iterated code $\mathcal{C}_{p^m}$ in terms of the SRR of $\mathcal{C}$. We consider the family of first-order binary Reed-Muller codes and show how the recovery structure, and consequently, the service rates of R$(1,m)$ for arbitrary $m$ can be recursively derived from a generator matrix of R$(1,2)$ through our results for successive Plotkin-type constructions.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.CO).
Categorie arXiv: Information Theory (cs.IT) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.01900 — 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-10-06T16:06:55.920Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).