You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis 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
Published by: American Mathematical Society
Stable URL: http://www.jstor.org/stable/2153114
Page Count: 8
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.
Preview not available
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.
Mathematics of Computation © 1993 American Mathematical Society