Linearized Polynomial Chinese remainder codes
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_ | 1866913851262369792 |
|---|---|
| author | Gaborit, Philippe Garnier, Camille Ruatta, Olivier |
| author_facet | Gaborit, Philippe Garnier, Camille Ruatta, Olivier |
| contents | In this paper, we introduce a new family of codes relevent for rank and sum-rank metrics. These codes are based on an effective Chinese remainders theorem for linearized polynomials over finite fields. We propose a decoding algorithm for some instances of these codes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_15720 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Linearized Polynomial Chinese remainder codes Gaborit, Philippe Garnier, Camille Ruatta, Olivier Rings and Algebras Information Theory Symbolic Computation 94B05, 94B35, 94B70, 11T71, 11T55 G.2; H.1.1; E.4 In this paper, we introduce a new family of codes relevent for rank and sum-rank metrics. These codes are based on an effective Chinese remainders theorem for linearized polynomials over finite fields. We propose a decoding algorithm for some instances of these codes. |
| title | Linearized Polynomial Chinese remainder codes |
| topic | Rings and Algebras Information Theory Symbolic Computation 94B05, 94B35, 94B70, 11T71, 11T55 G.2; H.1.1; E.4 |
| url | https://arxiv.org/abs/2505.15720 |