Pseudorandom vector generation by the multiple-recursive matrix method
Mathematics of Computation
Remarks on Singer Cyclic Groups and Their Normalizers
Designs, Codes and Cryptography
Research note: Counting nilpotent endomorphisms
Finite Fields and Their Applications
The Multiple-Recursive Matrix Method for Pseudorandom Number Generation
Finite Fields and Their Applications
Order of elements in the groups related to the general linear group
Finite Fields and Their Applications
Finite Fields and Their Applications
Word-Oriented transformation shift registers and their linear complexity
SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
Hi-index | 0.00 |
Using the structure of Singer cycles in general linear groups, we prove that a conjecture of Zeng et al. (Word-Oriented Feedback Shift Register: 驴-LFSR, 2007) holds in the affirmative in a special case, and outline a plausible approach to prove it in the general case. This conjecture is about the number of primitive 驴-LFSRs of a given order over a finite field, and it generalizes a known formula for the number of primitive LFSRs, which, in turn, is the number of primitive polynomials of a given degree over a finite field. Moreover, this conjecture is intimately related to an open question of Niederreiter (Finite Fields Appl 1:3---30, 1995) on the enumeration of splitting subspaces of a given dimension.