Classes of GFSR sequences and their fast generation

DOI10.1016/0893-9659(90)90023-5zbMath0794.65006OpenAlexW1985395735WikidataQ126388329 ScholiaQ126388329MaRDI QIDQ1813327

Xuduan Lin, Changnian Cai

Publication date: 25 June 1992

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(90)90023-5

zbMATH Keywords

fast algorithmrandom number generatorspseudorandom arraysgeneralized feedback shift register pseudorandom numbers

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An equivalence relation between Tausworthe and GFSR sequences and applications
• Linear Recurring Sequences
• The k -distribution of generalized feedback shift register pseudorandom numbers
• Initializing generalized feedback shift register pseudorandom number generators
• Orderly enumeration of nonsingular binary matrices applied to text encryption
• Random Numbers Generated by Linear Recurrence Modulo Two
• Generalized Feedback Shift Register Pseudorandom Number Algorithm

This page was built for publication: Classes of GFSR sequences and their fast generation