Maximum-length sequences, cellular automata, and random numbers
- 31 August 1987
- journal article
- Published by Elsevier in Journal of Computational Physics
- Vol. 71 (2) , 391-428
- https://doi.org/10.1016/0021-9991(87)90037-4
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A special-purpose processor for the Monte Carlo simulation of ising spin systemsJournal of Computational Physics, 1983
- A fast processor for Monte-Carlo simulationJournal of Computational Physics, 1983
- Partitioning the Period of a Class of m -Sequences and Application to Pseudorandom Number GenerationJournal of the ACM, 1978
- Theory and design of a digital stochastic computer random number generatorMathematics and Computers in Simulation, 1977
- Pseudo-randomness properties of binary shift register sequences (Corresp.)IEEE Transactions on Information Theory, 1975
- Generalized Feedback Shift Register Pseudorandom Number AlgorithmJournal of the ACM, 1973
- An Asymptotically Random Tausworthe SequenceJournal of the ACM, 1973
- The Runs Up-and-Down Performance of Tausworthe Pseudo-Random Number GeneratorsJournal of the ACM, 1971
- An analysis of the pseudo-randomness properties of subsequences of longm-sequencesIEEE Transactions on Information Theory, 1968
- Random numbers generated by linear recurrence modulo twoMathematics of Computation, 1965