Primitive Binary Polynomials

DOI10.2307/2005535zbMath0279.12007OpenAlexW4246900499MaRDI QIDQ4404996

Wayne Stahnke

Publication date: 1973

Full work available at URL: https://doi.org/10.2307/2005535

Mathematics Subject Classification ID

Finite fields and commutative rings (number-theoretic aspects) (11T99) Numerical computation of solutions to single equations (65H05) Polynomials over finite fields (11T06)

Related Items (10)

A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 ⋮ Small weight bases for Hamming codes ⋮ Small weight bases for hamming codes ⋮ A construction of primitive polynomials over finite fields ⋮ Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules ⋮ Polynomial pseudo-random number generator via cyclic phase ⋮ On the Periods of Generalized Fibonacci Recurrences ⋮ Primitive Polynomials Over Finite Fields ⋮ Maximum-length sequences, cellular automata, and random numbers ⋮ The least squares algorithm, parametric system identification and bounded noise

Cites Work

• Complete Factorization of 2 159 - 1
• Primitive Polynomials (Mod 2)
• Some Additional Factorizations of 2 n ± 1
• Some Factorizations of 2 n ± 1 and Related Results
• On primitive trinomials (Mod 2)
• Some Miscellaneous Factorizations
• Some Factorizations of Numbers of the Form 2 n ± 1
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Primitive Binary Polynomials