Evaluation of iterated Ore polynomials and skew Reed-Muller codes
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911476468416512 |
|---|---|
| author | Leroy, Andre Bennenni, Nabil |
| author_facet | Leroy, Andre Bennenni, Nabil |
| contents | In this paper, we study two ways of evaluating iterated Ore polynomials. We provide many examples and compare these evaluations. We use the evaluation maps to construct Reed-Muller codes and compute explicitly some of the data that are associated to such codes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_01287 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Evaluation of iterated Ore polynomials and skew Reed-Muller codes Leroy, Andre Bennenni, Nabil Information Theory Rings and Algebras 16S36, 94B05 In this paper, we study two ways of evaluating iterated Ore polynomials. We provide many examples and compare these evaluations. We use the evaluation maps to construct Reed-Muller codes and compute explicitly some of the data that are associated to such codes. |
| title | Evaluation of iterated Ore polynomials and skew Reed-Muller codes |
| topic | Information Theory Rings and Algebras 16S36, 94B05 |
| url | https://arxiv.org/abs/2603.01287 |