Evaluation of iterated Ore polynomials and skew Reed-Muller codes
Notice: This research summary and analysis were automatically generated using AI technology. For absolute accuracy, please refer to the [Original Paper Viewer] below or the Original ArXiv Source.
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.
💡 Research Summary
The paper investigates two distinct methods for evaluating iterated Ore polynomials and applies these evaluations to construct skew Reed‑Muller codes. It begins by recalling the definition of a skew polynomial ring R = K
Comments & Academic Discussion
Loading comments...
Leave a Comment