Explicit theorems on generator polynomials
From MaRDI portal
Publication:2566172
DOI10.1016/j.ffa.2005.05.002zbMath1087.11073MaRDI QIDQ2566172
Publication date: 22 September 2005
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2005.05.002
11-02: Research exposition (monographs, survey articles) pertaining to number theory
11T06: Polynomials over finite fields
11T55: Arithmetic theory of polynomial rings over finite fields
Related Items
Irreducibility of polynomials over global fields is diophantine, FACTORIZATION OF SOME COMPOSITE POLYNOMIALS OVER FINITE FIELDS, Irreducible polynomials with several prescribed coefficients, The minimum degree of minimal Ramsey graphs for cliques, New estimates and existence results about irreducible polynomials and self-reciprocal irreducible polynomials with prescribed coefficients over a finite field, Recursive constructions of irreducible polynomials over finite fields, On the Hansen-Mullen conjecture for self-reciprocal irreducible polynomials, On the action of \(\text{GL}_2(\mathbb F_q)\) on irreducible polynomials over \(\mathbb F_q\), Self-reciprocal irreducible polynomials with prescribed coefficients, Irreducible compositions of polynomials over finite fields, On coefficients of polynomials over finite fields, On explicit factors of cyclotomic polynomials over finite fields, A transform property of Kloosterman sums, A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields, On the number of \(N\)-free elements with prescribed trace, Elliptic curves and explicit enumeration of irreducible polynomials with two coefficients pre\-scribed, The number of irreducible polynomials of degree \(n\) over \(\mathbb F_q\) with given trace and constant terms, On enumeration of irreducible polynomials and related objects over a finite field with respect to their trace and norm, Counting irreducible polynomials with prescribed coefficients over a finite field, Enumeration of self-reciprocal irreducible monic polynomials with prescribed leading coefficients over a finite field, An extension of the (strong) primitive normal basis theorem, Composed products and factors of cyclotomic polynomials over finite fields, Counting irreducible binomials over finite fields, Normal bases and primitive elements over finite fields
Cites Work
- Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
- Specific irreducible polynomials with linearly independent roots over finite fields
- The distribution of irreducible polynomials in \(\mathbb{F}_q[t\)]
- Dickson polynomials, completely normal polynomials and the cyclic module structure of specific extensions of finite fields
- Algebraic constructions for Costas arrays
- On primitive polynomials over finite fields
- Primitive elements and polynomials with arbitrary trace
- Irreducible polynomials over a finite field and an analogue of Gauss sums over a field of characteristic 2
- The explicit construction of irreducible polynomials over finite fields
- On two exponential sums and their applications
- Completely normal elements in iterated quadratic extensions of finite fields
- Character sums over \(p\)-adic fields
- Primitive normal bases with prescribed trace
- Comment on: Construction of irreducible polynomials using cube transformation by W. M. Chu
- Irreducible polynomials over \(\mathrm{GF}(2)\) with three prescribed coefficients.
- Primitive polynomials with first and second coefficients prescribed.
- Character sums over Galois rings and primitive polynomials over finite fields.
- Irreducible polynomials over GF(2) with prescribed coefficients.
- Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
- Primitive normal bases for towers of field extensions
- Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.
- A characterization of primitive polynomials over finite fields.
- Generators for primary closures of Galois fields.
- Primitive polynomials over finite fields of characteristic two
- Explicit N-polynomials of \(2\)-power degree over finite fields. I
- Construction of irreducible polynomials using cubic transformation
- Primitivity, freeness, norm and trace
- Irreducible polynomials over finite fields with prescribed trace/prescribed constant term
- Primitive polynomial with three coefficients prescribed
- Primitive finite field elements with prescribed trace
- Primitive complete normal bases for regular extensions
- Primitive Roots in the Quadratic Extension of a Finite Field
- Estimates for Soto-Andrade sums.
- Primitive Polynomials Over Finite Fields
- Distribution des polynômes irréductibles dans $
- Generators and irreducible polynomials over finite fields
- Distribution of irreducible polynomials of small degrees over finite fields
- $p$-adic formal series and primitive polynomials over finite fields
- Characterizing Normal Bases via the Trace Map
- THE PRIMITIVE NORMAL BASIS THEOREM – WITHOUT A COMPUTER
- Primitive free quartics with specified norm and trace
- NEW PRIMITIVE TRINOMIALS OF MERSENNE-EXPONENT DEGREES FOR RANDOM-NUMBER GENERATION
- Kloosterman sums and primitive elements in Galois fields
- Primitive Normal Bases for Finite Fields
- Primitive free cubics with specified norm and trace
- $p$ -ADIC FORMAL SERIES AND COHENS PROBLEM This work was supported by NSF of China with contract No. 19971096 and No. 90104035.
- The coefficients of primitive polynomials over finite fields
- The Distribution of Irreducibles in GF [ q,x ]
- A Theorem of Dickson on Irreducible Polynomials
- Primitive elements with zero traces
- Normal bases over \(\text{GF}(q)\)
- Some primitive polynomials over finite fields
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
