Random numbers generated by linear recurrence modulo two
Author:
Robert C. Tausworthe
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
Full-text PDF Free Access
References | Similar Articles | Additional Information
- [1] S. W. Golomb, Sequences with Randomness Properties, Martin Co., Baltimore, Md., 1955.
- [2] Neal Zierler, Linear recurring sequences, J. Soc. Indust. Appl. Math. 7 (1959), 31–48. MR 101979
- [3] L. Baumert, et al., Coding theory and its Applications to Communications Systems, Report 32-167, Jet Propulsion Laboratory, Pasadena, Calif., 1961.
- [4] R. C. Titsworth & L. R. Welch, Modulation by Random and Pseudo-Random Sequences, Report 20-387, Jet Propulsion Laboratory, Pasadena, Calif., 1959.
- [5] Antoni Zygmund, Trigonometrical series, Dover Publications, New York, 1955. MR 0072976
- [6] W. Wesley Peterson, Error-correcting codes, The M.I.T. Press, Cambridge, Mass.; John Wiley & Sons, Inc., New York-London, 1961. MR 0121260
- [7] 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.
- [8] E. J. Watson, Primitive polynomials (𝑚𝑜𝑑2), Math. Comp. 16 (1962), 368–369. MR 148256, https://doi.org/10.1090/S0025-5718-1962-0148256-1
Retrieve articles in Mathematics of Computation with MSC: 65.15
Retrieve articles in all journals with MSC: 65.15
Additional Information
DOI:
https://doi.org/10.1090/S0025-5718-1965-0184406-1
Article copyright:
© Copyright 1965
American Mathematical Society