skip to main content
article
Free Access

Partitioning the Period of a Class of m-Sequences and Application to Pseudorandom Number Generation

Authors Info & Claims
Published:01 October 1978Publication History
First page image

References

  1. 1 DAVIES, A C. Further notes on delayed versions of linear binary sequences. Electron Letters 1, 7 (Sept. 1965), 190-191Google ScholarGoogle Scholar
  2. 2 HURD, W J Efficient generation of statlsUcally good pseudonolse by linearly interconnected shift registers. IE~~ Trans Comptrs C-23, 2 (Feb 1974), 146-152Google ScholarGoogle Scholar
  3. 3 KENDALL, M G, AND SMITH, B B, Randomness and random sampling numbers, d Roy Stattst Soc I01 (1938), 162-164.Google ScholarGoogle Scholar
  4. 4 LATAWIEC, K J A new method of generauon of shifted-linear pseudorandom bmary sequences Proc IEE 121, 8 (Aug. 1974), 905-906Google ScholarGoogle Scholar
  5. 5 LEWIS, T G, AND PAYI'~E, W H Generahzed feedback shift register pseudorandom number algorithm J ACM 20, 3 (July 1973), 456--468 Google ScholarGoogle Scholar
  6. 6 MARITSAS, D G., ARVILLIAS, A E, AND BOUNAS, A. Phase shift analys~s of linear shift register structures generating pseudorandom sequences To appear m IEEE Trans Comptrs Google ScholarGoogle Scholar
  7. 7 OBERMAN, R.M.M Dtsctphnes m Combmattonal and Sequential Circu# Design. McGraw-Hill, New York, 1970, pp. 474-484.Google ScholarGoogle Scholar
  8. 8 TAUSWORTHE, R C Random numbers generated by linear recurrence modulo two Math Comput 19 (1965), 201-209Google ScholarGoogle Scholar
  9. 9 TOOTILL, J P R, ROBINSON, W.D, AND ADAMS, A G The runs up-and-down performance of Tausworthe pseudo-random number generators. J. ACM 18, 3 (July 1971), 381-399 Google ScholarGoogle Scholar
  10. 10 TOOTILL, J P.R, ROBINSON, W.D, AND E^OLE, D.J An asymptotically random Tausworthe sequence. J.A CM 20, 3 (July 1973), 469-481. Google ScholarGoogle Scholar
  11. 11 WHITTLESEY, J.RB A comparison of the correlauonal behawor of random number generators for the IBM 360. Comm ACM 11, 9 (Sept. 1968), 641-644 Google ScholarGoogle Scholar
  12. 12 ZIERLER, N, AND BRILLHART, J On prlmmve trmommls (rood2), II, Inform. Contr. 14 (1969), 566-569Google ScholarGoogle Scholar

Index Terms

  1. Partitioning the Period of a Class of m-Sequences and Application to Pseudorandom Number Generation

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image Journal of the ACM
        Journal of the ACM  Volume 25, Issue 4
        Oct. 1978
        172 pages
        ISSN:0004-5411
        EISSN:1557-735X
        DOI:10.1145/322092
        Issue’s Table of Contents

        Copyright © 1978 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 October 1978
        Published in jacm Volume 25, Issue 4

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!