Evaluation of iterated Ore polynomials and skew Reed-Muller codes

arXiv (Cornell University) 2026 Preprint Open access

Read full text
Authors: André Leroy, Nabil Bennenni
DOI: 10.48550/arxiv.2603.01287
Cited by: 0

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.

Fields of Study & Subjects

Coding theory and cryptography Polynomial and algebraic computation Advanced Combinatorial Mathematics

Publication details

Journal / source
arXiv (Cornell University)
Publication date
1 March 2026
Language
EN
Document type
Preprint