Primitive trinomials of high degree
HTML articles powered by AMS MathViewer
- by Eugene R. Rodemich and Howard Rumsey PDF
- Math. Comp. 22 (1968), 863-865 Request permission
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].References
- Robert C. Tausworthe, Random numbers generated by linear recurrence modulo two, Math. Comp. 19 (1965), 201–209. MR 184406, DOI 10.1090/S0025-5718-1965-0184406-1
- A. Adrian Albert, Fundamental concepts of higher algebra, University of Chicago Press, Chicago, Ill., 1958. MR 0098735 S. W. Golomb, et. al., Digital Communications With Space Applications, Prentice-Hall, Englewood Cliffs, N. J., 1964.
- E. J. Watson, Primitive polynomials $(\textrm {mod}\ 2)$, Math. Comp. 16 (1962), 368–369. MR 148256, DOI 10.1090/S0025-5718-1962-0148256-1
- Richard G. Swan, Factorization of polynomials over finite fields, Pacific J. Math. 12 (1962), 1099–1106. MR 144891
Additional Information
- © Copyright 1968 American Mathematical Society
- Journal: Math. Comp. 22 (1968), 863-865
- MSC: Primary 12.30
- DOI: https://doi.org/10.1090/S0025-5718-1968-0238813-1
- MathSciNet review: 0238813