Metraipolis › archive › dc_1b1e8ea72fb0
Replica Thresholds for Stripeless Erasure Coding Based on Symmetric Block Designs — arXiv:2609.29149
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.29149
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T06:43:03.067Z
- SHA-256 of the archived text
10c789db5a3d7911abaaa62902fef5bdc61a1d81e4759aacbef3bdb4eee84a41- Stable URL of this page
https://metraipolis.com/documento/dc_1b1e8ea72fb0
How to cite
Replica Thresholds for Stripeless Erasure Coding Based on Symmetric Block Designs — arXiv:2609.29149 — arXiv (en), https://arxiv.org/abs/2609.29149 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1b1e8ea72fb0 (Metraipolis archive dc_1b1e8ea72fb0, sha256 10c789db5a3d7911abaaa62902fef5bdc61a1d81e4759aacbef3bdb4eee84a41)
BibTeX
@misc{dc1b1e8ea72fb0,
title = {Replica Thresholds for Stripeless Erasure Coding Based on Symmetric Block Designs — arXiv:2609.29149},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.29149},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1b1e8ea72fb0; sha256 10c789db5a3d7911abaaa62902fef5bdc61a1d81e4759aacbef3bdb4eee84a41},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29149. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper investigates a fundamental question in stripeless erasure coding based on symmetric balanced incomplete block designs (SBIBDs): how many replicas per object are precisely required to guarantee recovery from any set of at most $p$ node failures? We refine the known sufficient recovery guarantee for the generalized SBIBD $(v,k,\lambda)$ construction. One replica is necessary and sufficient for $p=1$, and $q=\lambda(p-1)+2$ replicas ($q\le k$) guarantee recovery for $p\ge2$. Recovery takes one round for $p=2$ and at most two rounds in general. To study the tightness of this count, we define the universal replica threshold $q^\ast(A,p)$ for a fixed zero-diagonal SBIBD representative~$A$. We determine $q^\ast(A,p)$ for $p=1$ and $p=2$. For $p\ge3$, we identify pairwise separated sets and private target permutations as the structures determining whether the sufficient count is tight or can be further reduced. These conditions give exact thresholds for all but the case where $\lambda>1$ and $A$ contains no pairwise separated set of size~$p$. We improve the bounds for this remaining case and leave its exact threshold open. Finally, we give sufficient conditions for pairwise separated sets and show how affinity relabeling can realize private target permutations. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.IT). Categorie arXiv: Information Theory (cs.IT). Pagina del lavoro: https://arxiv.org/abs/2609.29149 — 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-08T06:08:02.451Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).