Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Calculation of Fibonacci Polynomials for GFSR Sequences with Low Discrepancies

Shu Tezuka and Masanori Fushimi
Mathematics of Computation
Vol. 60, No. 202 (Apr., 1993), pp. 763-770
DOI: 10.2307/2153114
Stable URL: http://www.jstor.org/stable/2153114
Page Count: 8
  • Read Online (Free)
  • Download ($34.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Calculation of Fibonacci Polynomials for GFSR Sequences with Low Discrepancies
Preview not available

Abstract

Fibonacci polynomials are defined in the context of the two-dimensional discrepancy of Tausworthe pseudorandom sequences as an analogue to Fibonacci numbers, which give the best figure of merit for the two-dimensional discrepancy of linear congruential sequences. We conduct an exhaustive search for the Fibonacci polynomials of degree less than 32 whose associated Tausworthe sequences can be easily implemented and very quickly generated.

Page Thumbnails

  • Thumbnail: Page 
763
    763
  • Thumbnail: Page 
764
    764
  • Thumbnail: Page 
765
    765
  • Thumbnail: Page 
766
    766
  • Thumbnail: Page 
767
    767
  • Thumbnail: Page 
768
    768
  • Thumbnail: Page 
769
    769
  • Thumbnail: Page 
770
    770