The coefficients of primitive polynomials over finite fields
Open Access
- 1 January 1996
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 65 (213) , 331-340
- https://doi.org/10.1090/s0025-5718-96-00663-1
Abstract
For n ≥ 7 n\ge 7 , we prove that there always exists a primitive polynomial of degree n n over a finite field F q ( q odd ) F_q (q \operatorname {odd}) with the first and second coefficients prescribed in advance.Keywords
This publication has 10 references indexed in Scilit:
- Finite FieldsPublished by Cambridge University Press (CUP) ,1996
- Primitive polynomials over finite fieldsMathematics of Computation, 1992
- Primitive Polynomials Over Finite FieldsMathematics of Computation, 1992
- Primitive elements and polynomials with arbitrary traceDiscrete Mathematics, 1990
- On primitive polynomials over finite fieldsJournal of Algebra, 1989
- On the existence of a primitive quadratic of trace 1 over GF(pm)Journal of Combinatorial Theory, Series A, 1989
- Primitive normal bases for finite fieldsMathematics of Computation, 1987
- Primitive Normal Bases for Finite FieldsMathematics of Computation, 1987
- Equations over Finite Fields An Elementary ApproachLecture Notes in Mathematics, 1976
- Bases for Finite FieldsJournal of the London Mathematical Society, 1968