Please use this identifier to cite or link to this item:
https://doi.org/10.1007/s00605-007-0503-3
DC Field | Value | |
---|---|---|
dc.title | On the correlation of pseudorandom numbers generated by inversive methods | |
dc.contributor.author | Niederreiter, H. | |
dc.contributor.author | Rivat, J. | |
dc.date.accessioned | 2014-10-28T02:41:22Z | |
dc.date.available | 2014-10-28T02:41:22Z | |
dc.date.issued | 2008-03 | |
dc.identifier.citation | Niederreiter, H., Rivat, J. (2008-03). On the correlation of pseudorandom numbers generated by inversive methods. Monatshefte fur Mathematik 153 (3) : 251-264. ScholarBank@NUS Repository. https://doi.org/10.1007/s00605-007-0503-3 | |
dc.identifier.issn | 00269255 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/103781 | |
dc.description.abstract | We introduce two new types of inversive generators for pseudorandom numbers. These new methods offer several advantages over the conventional inversive generator. For instance, we establish good correlation properties of our generators that cannot be obtained for the conventional inversive generator with current methods. A new bound on character sums for finite fields is the essential technical tool for this work. © 2007 Springer-Verlag. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/s00605-007-0503-3 | |
dc.source | Scopus | |
dc.subject | Binary sequence | |
dc.subject | Character sum | |
dc.subject | Correlation | |
dc.subject | Discrepancy | |
dc.subject | Inversive pseudorandom numbers | |
dc.type | Article | |
dc.contributor.department | MATHEMATICS | |
dc.description.doi | 10.1007/s00605-007-0503-3 | |
dc.description.sourcetitle | Monatshefte fur Mathematik | |
dc.description.volume | 153 | |
dc.description.issue | 3 | |
dc.description.page | 251-264 | |
dc.identifier.isiut | 000253522500006 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.