Herendi, Tamás, Major, Roland Sándor (2022) Using irreducible polynomials for random number generation Annales Mathematicae et Informaticae. 56. pp. 36-46. ISSN 1787-6117 (Online)
pdf
AMI_56_from36to46.pdf Download (546kB) |
Absztrakt (kivonat)
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.
Mű típusa: | Folyóiratcikk | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Szerző: |
|
||||||||||||
Kapcsolódó URL-ek: | |||||||||||||
Kulcsszavak: | irreducible polynomials, finite fields, random number generation | ||||||||||||
Nyelv: | angol | ||||||||||||
Kötetszám: | 56. | ||||||||||||
DOI azonosító: | 10.33039/ami.2022.12.012 | ||||||||||||
ISSN: | 1787-6117 (Online) | ||||||||||||
Felhasználó: | Tibor Gál | ||||||||||||
Dátum: | 30 Dec 2022 17:11 | ||||||||||||
Utolsó módosítás: | 30 Dec 2022 17:32 | ||||||||||||
URI: | http://publikacio.uni-eszterhazy.hu/id/eprint/7585 |
Tétel nézet |