Abstract
For a finite field GF(q) of odd prime power order q, and n ≥ 1, we construct explicitly a sequence of monic irreducible reciprocal polynomials of degree n2m (m = 1, 2, 3, ...) over GF(q). It is the analog for fields of odd order of constructions of Wiedemann and of Meyn over GF(2). We also deduce iterated presentations of GF (q n2∞).
Similar content being viewed by others
References
Brawley, J.V. and Schnibben, G.E. 1989. Infinite Algebraic Extensions of Finite Fields, Contemporary Mathematics, vol. 95, Providence, RI: American Math. Society.
Carlitz, L. 1967. Some theorems on irreducible reciprocal polynomials over a finite field. J. Reine Angew. Math. 227:212–220.
Cohen, S.D. 1969. On irreducible polynomials of certain types in finite fields. Proc. Camb. Phil. Soc. 66:335–244.
Meyn, H. 1990. On the construction of irreducible self-receiprocal polynomials over finite fields. Appl. Algebra Eng. Comm. Comp. 1:43–53.
Niederreiter, H. 1990. An enumeration formula for certain irreducible polynomials with an application to the construction of irreducible polynomials over the binary field. Appl. Algebra Eng. Comm. Comp. 1:119–124.
Varshamov, R.R. 1984. A general method of synthesis for irreducible polynomials over Galois fields. Soviet Math. Dokl. 29:334–336.
Wiedemann, D. 1988. An iterated quadratic extension of GF(2). Fibonacci Quart. 26:290–295.
Author information
Authors and Affiliations
Additional information
Communicated by S.A. Vanstone
Rights and permissions
About this article
Cite this article
Cohen, S.D. The explicit construction of irreducible polynomials over finite fields. Des Codes Crypt 2, 169–174 (1992). https://doi.org/10.1007/BF00124895
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00124895