A Criterion for the Normality of Polynomials over Finite Fields Based on Their Coefficients
Xiang-dong Hou

TL;DR
This paper introduces a polynomial criterion based on coefficients to determine the normality of irreducible polynomials over finite fields, providing explicit formulas for degrees up to 6 and extending results to arbitrary fields with cyclic Galois groups.
Contribution
It defines a universal polynomial condition for polynomial normality over finite fields and computes it explicitly for degrees up to 5, with partial results for degree 6, also extending to arbitrary fields.
Findings
Explicit polynomial $h_n$ computed for $n \\le 5$
A simplified polynomial $h_{p,n}$ depending on characteristic $p$
Results valid for fields with cyclic Galois groups
Abstract
An irreducible polynomial over is said to be normal over if its roots are linearly independent over . We show that there is a polynomial , independent of , such that if an irreducible polynomial is such that , then is normal over . The polynomial is computed explicitly for and partially for . When , we also show that there is a polynomial , depending on , which is simpler than but has the same property. These results remain valid for monic separable irreducible polynomials over an arbitrary field with a cyclic Galois group.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cryptography and Residue Arithmetic · Algebraic Geometry and Number Theory
