Linear exact repair schemes for free MDS and Reed-Solomon codes over Galois rings
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_ | 1866912422748487680 |
|---|---|
| author | Bossaller, Daniel P. López, Hiram H. |
| author_facet | Bossaller, Daniel P. López, Hiram H. |
| contents | Codes over rings, especially over Galois rings, have been extensively studied for nearly three decades due to their similarity to linear codes over finite fields. A distributed storage system uses a linear code to encode a large file across several nodes. If one of the nodes fails, a linear exact repair scheme efficiently recovers the failed node by accessing and downloading data from the rest of the servers of the storage system. In this article, we develop a linear repair scheme for free maximum distance separable codes, which coincide with free maximum distance with respect to the rank codes over Galois rings. In particular, we give a linear repair scheme for full-length Reed-Solomon codes over a Galois ring. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_09017 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Linear exact repair schemes for free MDS and Reed-Solomon codes over Galois rings Bossaller, Daniel P. López, Hiram H. Information Theory Rings and Algebras Codes over rings, especially over Galois rings, have been extensively studied for nearly three decades due to their similarity to linear codes over finite fields. A distributed storage system uses a linear code to encode a large file across several nodes. If one of the nodes fails, a linear exact repair scheme efficiently recovers the failed node by accessing and downloading data from the rest of the servers of the storage system. In this article, we develop a linear repair scheme for free maximum distance separable codes, which coincide with free maximum distance with respect to the rank codes over Galois rings. In particular, we give a linear repair scheme for full-length Reed-Solomon codes over a Galois ring. |
| title | Linear exact repair schemes for free MDS and Reed-Solomon codes over Galois rings |
| topic | Information Theory Rings and Algebras |
| url | https://arxiv.org/abs/2506.09017 |