An equivalence relation between Tausworthe and GFSR sequences and applications

DOI10.1016/0893-9659(89)90006-2zbMath0707.94007OpenAlexW2057058960MaRDI QIDQ920070

Masanori Fushimi

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0893-9659(89)90006-2

zbMATH Keywords

pseudorandom sequencesgeneralized feedback shift register sequencelinear recurrences modulo two

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Random number generation in numerical analysis (65C10)

Related Items (6)

A universal GFSR random number generator for personal computers ⋮ A comparative study of some pseudorandom number generators ⋮ Calculation of Fibonacci Polynomials for GFSR Sequences with Low Discrepancies ⋮ Resolution-stationary random number generators ⋮ Uniform random number generation ⋮ Classes of GFSR sequences and their fast generation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A very fast shift-register sequence random number generator
• 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
• Partitioning the Period of a Class of m -Sequences and Application to Pseudorandom Number Generation
• Random Numbers Generated by Linear Recurrence Modulo Two
• Generalized Feedback Shift Register Pseudorandom Number Algorithm

This page was built for publication: An equivalence relation between Tausworthe and GFSR sequences and applications