Evaluation of iterated Ore polynomials and skew Reed-Muller codes
Information Theory
2026-03-03 v1 math.IT
Rings and Algebras
Abstract
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.
Cite
@article{arxiv.2603.01287,
title = {Evaluation of iterated Ore polynomials and skew Reed-Muller codes},
author = {Andre Leroy and Nabil Bennenni},
journal= {arXiv preprint arXiv:2603.01287},
year = {2026}
}
Comments
12 pages