Primitive Polynomials (Mod 2)

DOI10.2307/2004057MaRDI QIDQ3283916zbMATH OpenOpenAlexFDO

Authors E. J. Watson

Publication date 1962

Published in Mathematics of Computation (Search for Journal in Brave)

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

zbMATH Keywords

formsinvariantslinear algebrapolynomials

Cited in

(11)

• A universal GFSR random number generator for personal computers
• Practical stochastic multivariable identification for buildings
• Primitive Polynomials Over Finite Fields
• On the Periods of Generalized Fibonacci Recurrences
• Primitive Binary Polynomials
• 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
• Random Numbers Generated by Linear Recurrence Modulo Two
• scientific article; zbMATH DE number 3272787 (Why is no real title available?)
• Primitive Trinomials of High Degree
• Developments in secure random number generators

This page was built for publication: Primitive Polynomials (Mod 2)

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