Pages that link to "Item:Q3187277"

The following pages link to New recursive construction of normal polynomials over finite fields (Q3187277):

Displaying 7 items.

• Iterated constructions of irreducible polynomials over finite fields with linearly independent roots (Q596584) (← links)
• Specific irreducible polynomials with linearly independent roots over finite fields (Q677139) (← links)
• Recursive constructions of N-polynomials over \(\text{GF}(2^s)\) (Q947101) (← links)
• Explicit N-polynomials of \(2\)-power degree over finite fields. I (Q1894274) (← links)
• Some algorithms for normality testing irreducible polynomials and computing complexity of the normal polynomials over finite fields (Q2910410) (← links)
• Recursive construction of normal polynomials over finite fields (Q5059602) (← links)
• Construction of self-reciprocal normal polynomials over finite fields of even characteristic (Q5249119) (← links)