Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/23971| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Markovski, Smile | en_US |
| dc.contributor.author | Gligoroski, Danilo | en_US |
| dc.contributor.author | Bakeva, Verica | en_US |
| dc.date.accessioned | 2022-10-31T11:43:15Z | - |
| dc.date.available | 2022-10-31T11:43:15Z | - |
| dc.date.issued | 2001-12-20 | - |
| dc.identifier.uri | http://hdl.handle.net/20.500.12188/23971 | - |
| dc.description.abstract | It is well known that there are no perfectly good generators of random number sequences, implying the need of testing the randomness of the sequences produced by such generators. There are many tests for measuring the uniformity of random sequences, and here we propose a few new ones, designed by random walks. The experiments we have made show that our tests discover some discrepancies of random sequences passing many other tests. | en_US |
| dc.publisher | Odjel za matematiku, Sveučilište JJ Strossmayera u Osijeku | en_US |
| dc.relation.ispartof | Mathematical Communications | en_US |
| dc.subject | random sequence, random walk, PRNG (pseudo-random number generator), normal distribution; χ2-test | en_US |
| dc.title | Random walk tests for pseudo-random number generators | en_US |
| dc.type | Journal Article | en_US |
| item.grantfulltext | open | - |
| item.fulltext | With Fulltext | - |
| crisitem.author.dept | Faculty of Computer Science and Engineering | - |
| crisitem.author.dept | Faculty of Computer Science and Engineering | - |
| Appears in Collections: | Faculty of Computer Science and Engineering: Journal Articles | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| mc12_mar.pdf | 367.63 kB | Adobe PDF | View/Open |
Page view(s)
47
checked on May 11, 2024
Download(s)
4
checked on May 11, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.