Primitive Polynomials (Mod 2)
From MaRDI portal
Publication:3283916
DOI10.2307/2004057zbMath0101.25603OpenAlexW4254995797MaRDI QIDQ3283916
Publication date: 1962
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2004057
Related Items (10)
A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 ⋮ A universal GFSR random number generator for personal computers ⋮ Practical stochastic multivariable identification for buildings ⋮ Random Numbers Generated by Linear Recurrence Modulo Two ⋮ Primitive Trinomials of High Degree ⋮ A construction of primitive polynomials over finite fields ⋮ Unnamed Item ⋮ On the Periods of Generalized Fibonacci Recurrences ⋮ Primitive Polynomials Over Finite Fields ⋮ Primitive Binary Polynomials
This page was built for publication: Primitive Polynomials (Mod 2)
