Calculation of fibonacci polynomials for gfsr sequences with low discrepancies

Shu Tezuka, Masanori Fushimi

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)763-770
Number of pages8
JournalMathematics of Computation
Volume60
Issue number202
DOIs
Publication statusPublished - Apr 1993

All Science Journal Classification (ASJC) codes

  • Algebra and Number Theory
  • Computational Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Calculation of fibonacci polynomials for gfsr sequences with low discrepancies'. Together they form a unique fingerprint.

Cite this