A characterization of primitive polynomials over finite fields.
From MaRDI portal
The author proves the following result: Let \(p(x)\) be an irreducible polynomial of degree \(k\) over \(\text{GF}(q)\). Set \(m= q^k-1\), and \(g(x)= (x^m- 1)/(x- 1)p(x)\). Then \(p(x)\) is primitive if and only if \(g(x)\) has exactly \((q-1)q^{k- 1}-1\) nonzero terms. Then he applies this to BCH codes of maximal designed distance.
Recommendations
- scientific article; zbMATH DE number 4027620
- A modification of Fitzgerald's characterization of primitive polynomials over a finite field
- On the construction of irreducible and primitive polynomials from \(\mathbb{F}_{q^m} [x]\) to \(\mathbb{F}_q [x]\)
- Some primitive polynomials over finite fields
- Primitive Polynomials Over Finite Fields
Cited in
(11)- Characterization and enumeration of good punctured polynomials over finite fields
- On the construction of irreducible and primitive polynomials from \(\mathbb{F}_{q^m} [x]\) to \(\mathbb{F}_q [x]\)
- A modification of Fitzgerald's characterization of primitive polynomials over a finite field
- Explicit theorems on generator polynomials
- Companion matrix and recognition of primitive polynomial
- The Divisors of $x^{2m} + x$ of Constant Derivatives and Degree $2^{m - 2}$
- scientific article; zbMATH DE number 1504691 (Why is no real title available?)
- A construction of primitive polynomials over finite fields
- A new proof of Fitzgerald's characterization of primitive polynomials
- Quasi-self-reciprocal polynomials and potentially large minimum distance BCH codes
- A characterization and an explicit description of all primitive polynomials of degree two
This page was built for publication: A characterization of primitive polynomials over finite fields.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1867484)
