Abstract
A systematic search method is employed to find multipliers for linear congruential pseudo-random number generation which are optimal with respect to statistical independence of pairs of successive pseudo-random numbers. Tables of such optimal multipliers corresponding to moduli 2 n ,n ≦ 35, are included.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.