### 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 language | English |
---|---|

Pages (from-to) | 763-770 |

Number of pages | 8 |

Journal | Mathematics of Computation |

Volume | 60 |

Issue number | 202 |

DOIs | |

Publication status | Published - Jan 1 1993 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Algebra and Number Theory
- Computational Mathematics
- Applied Mathematics

### Cite this

*Mathematics of Computation*,

*60*(202), 763-770. https://doi.org/10.1090/S0025-5718-1993-1160278-0

**Calculation of fibonacci polynomials for gfsr sequences with low discrepancies.** / Tezuka, Shu; Fushimi, Masanori.

Research output: Contribution to journal › Article

*Mathematics of Computation*, vol. 60, no. 202, pp. 763-770. https://doi.org/10.1090/S0025-5718-1993-1160278-0

}

TY - JOUR

T1 - Calculation of fibonacci polynomials for gfsr sequences with low discrepancies

AU - Tezuka, Shu

AU - Fushimi, Masanori

PY - 1993/1/1

Y1 - 1993/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84968513708&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84968513708&partnerID=8YFLogxK

U2 - 10.1090/S0025-5718-1993-1160278-0

DO - 10.1090/S0025-5718-1993-1160278-0

M3 - Article

VL - 60

SP - 763

EP - 770

JO - Mathematics of Computation

JF - Mathematics of Computation

SN - 0025-5718

IS - 202

ER -