Explicit theorems on generator polynomials
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1588466 (Why is no real title available?)
- scientific article; zbMATH DE number 1594295 (Why is no real title available?)
- scientific article; zbMATH DE number 426121 (Why is no real title available?)
- scientific article; zbMATH DE number 4204482 (Why is no real title available?)
- scientific article; zbMATH DE number 1222349 (Why is no real title available?)
- scientific article; zbMATH DE number 1156677 (Why is no real title available?)
- scientific article; zbMATH DE number 2061795 (Why is no real title available?)
- scientific article; zbMATH DE number 1528681 (Why is no real title available?)
- scientific article; zbMATH DE number 1361739 (Why is no real title available?)
- scientific article; zbMATH DE number 953225 (Why is no real title available?)
- scientific article; zbMATH DE number 1866876 (Why is no real title available?)
- scientific article; zbMATH DE number 2108070 (Why is no real title available?)
- scientific article; zbMATH DE number 2108073 (Why is no real title available?)
- scientific article; zbMATH DE number 2124962 (Why is no real title available?)
- scientific article; zbMATH DE number 908558 (Why is no real title available?)
- scientific article; zbMATH DE number 3397622 (Why is no real title available?)
- $p$ -ADIC FORMAL SERIES AND COHENS PROBLEM This work was supported by NSF of China with contract No. 19971096 and No. 90104035.
- $p$-adic formal series and primitive polynomials over finite fields
- A Theorem of Dickson on Irreducible Polynomials
- A characterization of primitive polynomials over finite fields.
- Algebraic constructions for Costas arrays
- Character sums over Galois rings and primitive polynomials over finite fields.
- Character sums over p-adic fields
- Characterizing Normal Bases via the Trace Map
- Comment on: Construction of irreducible polynomials using cube transformation by W. M. Chu
- Completely normal elements in iterated quadratic extensions of finite fields
- Construction of irreducible polynomials using cubic transformation
- Dickson polynomials, completely normal polynomials and the cyclic module structure of specific extensions of finite fields
- Distribution des polynômes irréductibles dans $
- Distribution of irreducible polynomials of small degrees over finite fields
- Estimates for Soto-Andrade sums.
- Explicit N-polynomials of \(2\)-power degree over finite fields. I
- Finite fields: normal bases and completely free elements
- Generators and irreducible polynomials over finite fields
- Generators for primary closures of Galois fields.
- Irreducible polynomials over GF(2) with prescribed coefficients.
- Irreducible polynomials over \(\mathrm{GF}(2)\) with three prescribed coefficients.
- Irreducible polynomials over a finite field and an analogue of Gauss sums over a field of characteristic 2
- Irreducible polynomials over finite fields with prescribed trace/prescribed constant term
- Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
- Kloosterman sums and primitive elements in Galois fields
- NEW PRIMITIVE TRINOMIALS OF MERSENNE-EXPONENT DEGREES FOR RANDOM-NUMBER GENERATION
- Normal bases over \(\text{GF}(q)\)
- On primitive polynomials over finite fields
- On the coefficients of primitive polynomials over finite fields
- On two exponential sums and their applications
- Primitive Normal Bases for Finite Fields
- Primitive Polynomials Over Finite Fields
- Primitive Roots in the Quadratic Extension of a Finite Field
- Primitive complete normal bases for regular extensions
- Primitive elements and polynomials with arbitrary trace
- Primitive elements with zero traces
- Primitive finite field elements with prescribed trace
- Primitive free cubics with specified norm and trace
- Primitive free quartics with specified norm and trace
- Primitive normal bases for towers of field extensions
- Primitive normal bases with prescribed trace
- Primitive polynomial with three coefficients prescribed
- Primitive polynomials over finite fields of characteristic two
- Primitive polynomials with first and second coefficients prescribed.
- Primitivity, freeness, norm and trace
- Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.
- Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
- Some primitive polynomials over finite fields
- Specific irreducible polynomials with linearly independent roots over finite fields
- THE PRIMITIVE NORMAL BASIS THEOREM – WITHOUT A COMPUTER
- The Distribution of Irreducibles in GF [ q,x ]
- The coefficients of primitive polynomials over finite fields
- The distribution of irreducible polynomials in \(\mathbb{F}_q[t]\)
- The explicit construction of irreducible polynomials over finite fields
Cited in
(26)- Enumeration of self-reciprocal irreducible monic polynomials with prescribed leading coefficients over a finite field
- On the action of \(\text{GL}_2(\mathbb F_q)\) on irreducible polynomials over \(\mathbb F_q\)
- On enumeration of irreducible polynomials and related objects over a finite field with respect to their trace and norm
- On explicit factors of cyclotomic polynomials over finite fields
- Realization and GCD-existence theorem for generalized polynomials
- Normal bases and primitive elements over finite fields
- Counting irreducible binomials over finite fields
- A transform property of Kloosterman sums
- Factorization of some composite polynomials over finite fields
- Irreducible compositions of polynomials over finite fields
- On coefficients of polynomials over finite fields
- On the Hansen-Mullen conjecture for self-reciprocal irreducible polynomials
- Recursive constructions of irreducible polynomials over finite fields
- An extension of the (strong) primitive normal basis theorem
- Self-reciprocal irreducible polynomials with prescribed coefficients
- The minimum degree of minimal Ramsey graphs for cliques
- A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields
- Irreducible polynomials with several prescribed coefficients
- On the number of N-free elements with prescribed trace
- Elliptic curves and explicit enumeration of irreducible polynomials with two coefficients pre\-scribed
- Irreducibility of polynomials over global fields is diophantine
- Asymptotic distributions of the number of zeros of random polynomials in Hayes equivalence class over a finite field
- New estimates and existence results about irreducible polynomials and self-reciprocal irreducible polynomials with prescribed coefficients over a finite field
- Composed products and factors of cyclotomic polynomials over finite fields
- The number of irreducible polynomials of degree n over F_q with given trace and constant terms
- Counting irreducible polynomials with prescribed coefficients over a finite field
This page was built for publication: Explicit theorems on generator polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2566172)
