Primitive Trinomials of High Degree
- 1 October 1968
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 22 (104) , 863-865
- https://doi.org/10.2307/2004585
Abstract
New primitive polynomials $(\bmod 2)$ of high degree were found by the methods described here. The polynomials are all trinomials; such trinomials are useful for generating pseudo-random sequences of $0$’s and $1$’s of long length [1].
Keywords
This publication has 2 references indexed in Scilit:
- Random Numbers Generated by Linear Recurrence Modulo TwoMathematics of Computation, 1965
- Factorization of polynomials over finite fieldsPacific Journal of Mathematics, 1962