An approach to normal polynomials through symmetrization and symmetric reduction
From MaRDI portal
Publication:6655751
Recommendations
- A criterion for the normality of polynomials over finite fields based on their coefficients
- Normal elements and irreducible polynomials in finite fields
- Normal bases and irreducible polynomials
- New recursive construction of normal polynomials over finite fields
- Some algorithms for normality testing irreducible polynomials and computing complexity of the normal polynomials over finite fields
Cites work
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 3788760 (Why is no real title available?)
- scientific article; zbMATH DE number 739282 (Why is no real title available?)
- scientific article; zbMATH DE number 1846962 (Why is no real title available?)
- A criterion for the normality of polynomials over finite fields based on their coefficients
- An approach to normal polynomials through symmetrization and symmetric reduction
- Complexities of normal bases constructed from Gauss periods
- Galois module structure
- General formulas for solving solvable sextic equations
- Handbook of finite fields
- Low Complexity Normal Elements over Finite Fields of Characteristic Two
- New light on Frobenius' creation of the theory of group characters
- Normal bases of cyclic fields of primepower degree
- Normal basis of finite field<tex>GF(2^m)</tex>(Corresp.)
- On the group determinant
- Optimal normal bases in \(GF(p^ n)\)
- Primitive Normal Bases for Finite Fields
- Representations and characters of groups.
- Solving Solvable Quintics
- The Group Determinant Determines the Group
- The origin of the theory of group characters
Cited in
(2)
This page was built for publication: An approach to normal polynomials through symmetrization and symmetric reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655751)