Calculation of Fibonacci Polynomials for GFSR Sequences with Low Discrepancies

DOI10.2307/2153114zbMath0777.65002OpenAlexW4235447081MaRDI QIDQ5288232

Masanori Fushimi, Shu Tezuka

Publication date: 15 August 1993

Full work available at URL: https://doi.org/10.2307/2153114

zbMATH Keywords

continued fractionFibonacci polynomialspseudorandom sequencesgeneralized feedback shift register algorithmTausworthe sequence

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Random number generation in numerical analysis (65C10) Continued fraction calculations (number-theoretic aspects) (11Y65) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (2)

A table of short-period Tausworthe generators for Markov chain quasi-Monte Carlo ⋮ Uniform random number generation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Continued fraction expansions of rational expressions with irreducible denominators in characteristic 2
• Point sets and sequences with small discrepancy
• An equivalence relation between Tausworthe and GFSR sequences and applications
• Rational functions with partial quotients of small degree in their continued fraction expansion
• Optimal characteristic polynomials for digital multistep pseudorandom numbers
• Optimal multipliers for pseudo-random number generation by the linear congruential method
• Figures of Merit for Digital Multistep Pseudorandom Numbers
• On the discrepancy of GFSR pseudorandom numbers
• A Statistical Analysis of Generalized Feedback Shift Register Pseudorandom Number Generators
• Random Numbers Generated by Linear Recurrence Modulo Two
• An Asymptotically Random Tausworthe Sequence
• Generalized Feedback Shift Register Pseudorandom Number Algorithm

This page was built for publication: Calculation of Fibonacci Polynomials for GFSR Sequences with Low Discrepancies