REAL

Using irreducible polynomials for random number generation

Herendi, Tamás and Major, Sándor Roland (2022) Using irreducible polynomials for random number generation. Annales Mathematicae et Informaticae, 56. pp. 36-46. ISSN 17876117

[img]
Preview
Text
AMI_56_from36to46.pdf - Published Version

Download (546kB) | Preview

Abstract

A method is presented for generating random numbers with uniform distribution using linear recurrence sequences with very large period lengths. This method requires an irreducible polynomial modulo 2 to define the sequence. A suitable method for generating an infinite number of such polynomials is presented. The polynomials generated in this way can have an arbitrarily large degree, and a large enough order to make them suitable for practical applications.

Item Type: Article
Uncontrolled Keywords: irreducible polynomials, finite fields, random number generation
Subjects: Q Science / természettudomány > QA Mathematics / matematika
Depositing User: Tibor Gál
Date Deposited: 09 Jan 2023 09:35
Last Modified: 09 Jan 2023 09:35
URI: http://real.mtak.hu/id/eprint/156199

Actions (login required)

Edit Item Edit Item