Swan-like results for binomials and trinomials over finite fields of odd characteristic
From MaRDI portal
Publication:648071
Recommendations
Cites work
- A Swan-like theorem
- A note on the reducibility of binary affine polynomials
- Efficient \(p\)th root computations in finite fields of characteristic \(p\)
- Factorization of polynomials over finite fields
- Factorization of trinomials over Galois fields of characteristic 2
- Integer factoring
- Irreducible trinomials over finite fields
- On the distribution of irreducible trinomials over \(\mathbb F_3\)
- Parity of the number of irreducible factors for composite polynomials
- Swan's theorem for binary tetranomials
- Ten new primitive binary trinomials
- The parity of the number of irreducible factors for some pentanomials
Cited in
(14)- Block companion singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields
- A Swan-like note for a family of binary pentanomials
- On the discriminant of a trinomial
- A note on the reducibility of binary affine polynomials
- A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields
- Equal-degree factorization of binomials and trinomials over finite fields
- On polynomials \(x^n-1\) over binary fields whose irreducible factors are binomials and trinomials
- A note on the stability of trinomials over finite fields
- Parity of the number of irreducible factors for composite polynomials
- A Swan-like theorem
- Swan's theorem for binary tetranomials
- Sudoku-like arrays, codes and orthogonality
- Irreducible trinomials over finite fields
- Monogenic reciprocal trinomials and their Galois groups
This page was built for publication: Swan-like results for binomials and trinomials over finite fields of odd characteristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648071)