Pseudorandom vector generation by the multiple-recursive matrix method
Mathematics of Computation
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Word Oriented Cascade Jump σ-LFSR
AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Primitive polynomials, singer cycles and word-oriented linear feedback shift registers
Designs, Codes and Cryptography
Generation of binary sequences with controllable complexity
IEEE Transactions on Information Theory
An analysis of the structure and complexity of nonlinear binary sequence generators
IEEE Transactions on Information Theory
Linear transformation shift registers
IEEE Transactions on Information Theory
The Multiple-Recursive Matrix Method for Pseudorandom Number Generation
Finite Fields and Their Applications
Finite Fields and Their Applications
Efficient Linear Feedback Shift Registers with Maximal Period
Finite Fields and Their Applications
Hi-index | 0.00 |
We discuss the problem of counting the number of primitive transformation shift registers and its equivalent formulation in terms of Singer cycles in a corresponding general linear group. We also introduce the notion of word-oriented nonlinearly filtered primitive transformation shift registers based on a Langford arrangement and study their linear complexity.