Primitive Binary Polynomials

DOI10.2307/2005535MaRDI QIDQ4404996zbMATH OpenOpenAlexFDO

Authors Wayne Stahnke

Publication date 1973

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

Mathematics Subject Classification ID

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

Cites work

• Algebraic coding theory
• Complete Factorization of 2 159 - 1
• scientific article; zbMATH DE number 3448644 (Why is no real title available?)
• scientific article; zbMATH DE number 3422259 (Why is no real title available?)
• scientific article; zbMATH DE number 3040872 (Why is no real title available?)
• scientific article; zbMATH DE number 3073141 (Why is no real title available?)
• On primitive trinomials (Mod 2)
• Primitive Polynomials (Mod 2)
• Some Additional Factorizations of 2 n ± 1
• Some Factorizations of 2 n ± 1 and Related Results
• Some Factorizations of Numbers of the Form 2 n ± 1
• Some Miscellaneous Factorizations

Cited in

(10)

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

This page was built for publication: Primitive Binary Polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4404996)