List decoding of evaluation 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_ | 1866918153059041280 |
|---|---|
| author | Brazitikos, Silouanos Garefalakis, Theodoulos Tzanaki, Eleni |
| author_facet | Brazitikos, Silouanos Garefalakis, Theodoulos Tzanaki, Eleni |
| contents | Polynomial evaluation codes hold a prominent place in coding theory. In this work, we study the problem of list decoding for a general class of polynomial evaluation codes, also known as Toric codes, that are defined for any given convex polytope P. Special cases, such as Reed-Solomon and Reed-Muller codes, have been studied extensively. We present a generalization of the Guruswami-Sudan algorithm that takes into account the geometry and the combinatorics of P and compute bounds for the decoding radius. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_01811 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | List decoding of evaluation codes Brazitikos, Silouanos Garefalakis, Theodoulos Tzanaki, Eleni Information Theory Polynomial evaluation codes hold a prominent place in coding theory. In this work, we study the problem of list decoding for a general class of polynomial evaluation codes, also known as Toric codes, that are defined for any given convex polytope P. Special cases, such as Reed-Solomon and Reed-Muller codes, have been studied extensively. We present a generalization of the Guruswami-Sudan algorithm that takes into account the geometry and the combinatorics of P and compute bounds for the decoding radius. |
| title | List decoding of evaluation codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2510.01811 |