Calculation of Fibonacci Polynomials for GFSR Sequences with Low Discrepancies

DOI10.2307/2153114zbMATH Open0777.65002OpenAlexW4235447081MaRDI QIDQ5288232FDOQ5288232

Authors: Shu Tezuka, Masanori Fushimi 

Publication date: 15 August 1993

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

Recommendations

• Fibonacci and Galois representations of feedback-with-carry shift registers
• On the Periods of Generalized Fibonacci Recurrences
• On the discrepancy of GFSR pseudorandom numbers
• On the statistical independence of shift-register pseudorandom multisequence over part of the period

zbMATH Keywords

continued fractionFibonacci polynomialspseudorandom sequencesgeneralized feedback shift register algorithmTausworthe sequence

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5288232)