Recursive constructions of irreducible polynomials over finite fields (Q439081)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6062676
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recursive constructions of irreducible polynomials over finite fields |
scientific article; zbMATH DE number 6062676 |
Statements
Recursive constructions of irreducible polynomials over finite fields (English)
0 references
1 August 2012
0 references
Galois field
0 references
composite polynomial
0 references
irreducible polynomial
0 references
recurrent method
0 references
0 references
0 references
Let \(F_q\) be a finite field of characteristic \(p\) and let \(P(x)\in F_q[x]\) be an irreducible polynomial of degree \(n\geq 2\). The authors give conditions for the irreducibility of NEWLINE\[NEWLINE F(x) = (x^p-bx+h)^nP\left(\frac{x^p-bx+c}{x^p-bx+h}\right). NEWLINE\]NEWLINE As main tool they use a result in [\textit{S. D. Cohen}, Proc. Camb. Philos. Soc. 66, 335--344 (1969; Zbl 0177.06601)] on the irreducibility of polynomials of the form \(g^n(x)P(f(x)/g(x))\). Recursively, the authors obtain irreducible polynomials of higher degree.
0 references
0.8831321001052856
0 references
0.8588615655899048
0 references
0.8555362224578857
0 references
0.8403799533843994
0 references
