Calculation of Fibonacci Polynomials for GFSR Sequences with Low Discrepancies
From MaRDI portal
Publication:5288232
Recommendations
Cites work
- scientific article; zbMATH DE number 4090661 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3997925 (Why is no real title available?)
- A Statistical Analysis of Generalized Feedback Shift Register Pseudorandom Number Generators
- An Asymptotically Random Tausworthe Sequence
- An equivalence relation between Tausworthe and GFSR sequences and applications
- Continued fraction expansions of rational expressions with irreducible denominators in characteristic 2
- Figures of Merit for Digital Multistep Pseudorandom Numbers
- Generalized Feedback Shift Register Pseudorandom Number Algorithm
- On the discrepancy of GFSR pseudorandom numbers
- Optimal characteristic polynomials for digital multistep pseudorandom numbers
- Optimal multipliers for pseudo-random number generation by the linear congruential method
- Point sets and sequences with small discrepancy
- Random Numbers Generated by Linear Recurrence Modulo Two
- Rational functions with partial quotients of small degree in their continued fraction expansion
Cited in
(2)
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)