Random numbers generated by linear recurrence modulo two
HTML articles powered by AMS MathViewer
- by Robert C. Tausworthe PDF
- Math. Comp. 19 (1965), 201-209 Request permission
References
-
S. W. Golomb, Sequences with Randomness Properties, Martin Co., Baltimore, Md., 1955.
- Neal Zierler, Linear recurring sequences, J. Soc. Indust. Appl. Math. 7 (1959), 31–48. MR 101979 L. Baumert, et al., Coding theory and its Applications to Communications Systems, Report 32–167, Jet Propulsion Laboratory, Pasadena, Calif., 1961. R. C. Titsworth & L. R. Welch, Modulation by Random and Pseudo-Random Sequences, Report 20–387, Jet Propulsion Laboratory, Pasadena, Calif., 1959.
- Antoni Zygmund, Trigonometrical series, Dover Publications, New York, 1955. MR 0072976
- W. Wesley Peterson, Error-correcting codes, The M.I.T. Press, Cambridge, Mass.; John Wiley & Sons, Inc., New York-London, 1961. MR 0121260 S. W. Golomb, L. R. Welch & A. Hales, On the Factorization of Trinomials Over GF(2)," Report 20–189, Jet Propulsion Laboratory, Pasadena, Calif., 1959.
- E. J. Watson, Primitive polynomials $(\textrm {mod}\ 2)$, Math. Comp. 16 (1962), 368–369. MR 148256, DOI 10.1090/S0025-5718-1962-0148256-1
Additional Information
- © Copyright 1965 American Mathematical Society
- Journal: Math. Comp. 19 (1965), 201-209
- MSC: Primary 65.15
- DOI: https://doi.org/10.1090/S0025-5718-1965-0184406-1
- MathSciNet review: 0184406