Efficient Repair of (k+2, k) Degraded Read Friendly MDS Array Codes With Sub-packetization 2
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_ | 1866911234780037120 |
|---|---|
| author | Li, Jie Tang, Xiaohu |
| author_facet | Li, Jie Tang, Xiaohu |
| contents | In this paper, we present two constructions of degraded read friendly (DRF) MDS array codes with two parity nodes and a sub-packetization level of 2 over small finite fields, applicable for any arbitrary code length. The first construction achieves the smallest repair bandwidth among all existing constructions with the same parameters, and is asymptotically optimal with respect to the lower bound on the average repair bandwidth characterized by Zhang et al. The second construction supports two repair mechanisms, depending on whether computation within the helper nodes is permitted or not during the node repair process, thereby optimizing either the repair bandwidth or the rebuilding access. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_23316 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Efficient Repair of (k+2, k) Degraded Read Friendly MDS Array Codes With Sub-packetization 2 Li, Jie Tang, Xiaohu Information Theory In this paper, we present two constructions of degraded read friendly (DRF) MDS array codes with two parity nodes and a sub-packetization level of 2 over small finite fields, applicable for any arbitrary code length. The first construction achieves the smallest repair bandwidth among all existing constructions with the same parameters, and is asymptotically optimal with respect to the lower bound on the average repair bandwidth characterized by Zhang et al. The second construction supports two repair mechanisms, depending on whether computation within the helper nodes is permitted or not during the node repair process, thereby optimizing either the repair bandwidth or the rebuilding access. |
| title | Efficient Repair of (k+2, k) Degraded Read Friendly MDS Array Codes With Sub-packetization 2 |
| topic | Information Theory |
| url | https://arxiv.org/abs/2510.23316 |