Classes of GFSR sequences and their fast generation
From MaRDI portal
Recommendations
Cites work
- An equivalence relation between Tausworthe and GFSR sequences and applications
- Generalized Feedback Shift Register Pseudorandom Number Algorithm
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 3685395 (Why is no real title available?)
- scientific article; zbMATH DE number 3686641 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3422259 (Why is no real title available?)
- Initializing generalized feedback shift register pseudorandom number generators
- Linear Recurring Sequences
- Orderly enumeration of nonsingular binary matrices applied to text encryption
- Random Numbers Generated by Linear Recurrence Modulo Two
- The k -distribution of generalized feedback shift register pseudorandom numbers
Cited in
(2)
This page was built for publication: Classes of GFSR sequences and their fast generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1813327)