String decomposition of full-period tausworthe sequences

DOI10.1080/03610918708812611zbMath0634.65004OpenAlexW2056932780MaRDI QIDQ3773157

Bruce Jay Collings

Publication date: 1987

Published in: Communications in Statistics - Simulation and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610918708812611

zbMATH Keywords

decompositionprimitive polynomialsmaximal-length strings of like bitsTausworthe sequences

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10)

Related Items (1)

Recent trends in random number and random vector generation

Cites Work

• Linear Recurring Sequences
• Initializing generalized feedback shift register pseudorandom number generators
• Efficient Generation of Statistically Good Pseudonoise by Linearly Interconnected Shift Registers
• Generalized Feedback Shift Register Pseudorandom Number Algorithm

This page was built for publication: String decomposition of full-period tausworthe sequences