Designing a Uniform Random Number Generator Whose Subsequences are k-Distributed

DOI10.1137/0217006zbMath0637.65002OpenAlexW2008353845MaRDI QIDQ3777296

Masanori Fushimi

Publication date: 1988

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0217006

zbMATH Keywords

M-sequenceGaussian elimination method0-1 integer linear programmingk-distributed sequenceTausworthe sequenceuniform random number generators

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Finite fields and commutative rings (number-theoretic aspects) (11T99) Random number generation in numerical analysis (65C10) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (3)

Recent trends in random number and random vector generation ⋮ Benchmark data set with service programs to approximately solve the set covering problem ⋮ A computational study of a genetic algorithm to solve the set covering problem

This page was built for publication: Designing a Uniform Random Number Generator Whose Subsequences are k-Distributed