Lower Bounds on the Sub-Packetization of Optimal-Access MSR Codes for Multiple-Node Repair
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910794631872512 |
|---|---|
| author | Wang, Lewen Zhang, Zihao Hu, Sihuang |
| author_facet | Wang, Lewen Zhang, Zihao Hu, Sihuang |
| contents | We establish lower bounds on the sub-packetization of optimal-access MSR codes in the context of multiple-node failures. These bounds generalize the tight bounds for single-node failure presented by Balaji et al. (IEEE Transactions on Information Theory, vol. 68, no. 10, 2022). Moreover, we utilize generating functions to provide a more refined analysis, further strengthening these bounds. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_12984 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Lower Bounds on the Sub-Packetization of Optimal-Access MSR Codes for Multiple-Node Repair Wang, Lewen Zhang, Zihao Hu, Sihuang Information Theory We establish lower bounds on the sub-packetization of optimal-access MSR codes in the context of multiple-node failures. These bounds generalize the tight bounds for single-node failure presented by Balaji et al. (IEEE Transactions on Information Theory, vol. 68, no. 10, 2022). Moreover, we utilize generating functions to provide a more refined analysis, further strengthening these bounds. |
| title | Lower Bounds on the Sub-Packetization of Optimal-Access MSR Codes for Multiple-Node Repair |
| topic | Information Theory |
| url | https://arxiv.org/abs/2501.12984 |