Maximum-length sequences, cellular automata, and random numbers

DOI10.1016/0021-9991(87)90037-4zbMath0616.65001OpenAlexW2051931634MaRDI QIDQ1821479

A. Compagner, A. Hoogland

Publication date: 1987

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9991(87)90037-4

zbMATH Keywords

softwarecellular automatacorrelation functionslinear-feedback shift registersmaximum-length sequencesrandom-number generators

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Probabilistic methods, stochastic differential equations (65C99)

Related Items (4)

A comparative study of some pseudorandom number generators ⋮ A search for good pseudo-random number generators: survey and empirical studies ⋮ On the Use of Reducible Polynomials as Random Number Generators ⋮ A VLSI architecture for percolation simulation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A special-purpose processor for the Monte Carlo simulation of Ising spin systems
• A fast processor for Monte-Carlo simulation
• A very fast shift-register sequence random number generator
• Theory and design of a digital stochastic computer random number generator
• Parallel concepts in graph theory
• Statistical mechanics of cellular automata
• Pseudo-randomness properties of binary shift register sequences (Corresp.)
• Partitioning the Period of a Class of m -Sequences and Application to Pseudorandom Number Generation
• On rotational tessellations and copses
• Primitive Binary Polynomials
• Random Numbers Generated by Linear Recurrence Modulo Two
• Time-Dependent Statistics of the Ising Model
• On primitive trinomials (mod 2), II
• On xn + x + 1 over GF(2)
• The Runs Up-and-Down Performance of Tausworthe Pseudo-Random Number Generators
• An Asymptotically Random Tausworthe Sequence

This page was built for publication: Maximum-length sequences, cellular automata, and random numbers