An asymptotic formula for the number of irreducible transformation shift registers
arXiv:1506.02548 · doi:10.1016/j.laa.2015.06.020
Abstract
We consider the problem of enumerating the number of irreducible transformation shift registers. We give an asymptotic formula for the number of irreducible transformation shift registers in some special cases. Moreover, we derive a short proof for the exact number of irreducible transformation shift registers of order two using a recent generalization of a theorem of Carlitz.
arXiv comment14 pages
References in corpus (5)
- Efficient linear feedback shift registers with maximal period
- Primitive Polynomials, Singer Cycles, and Word-Oriented Linear Feedback Shift Registers
- Block Companion Singer Cycles, Primitive Recursive Vector Sequences, and Coprime Polynomial Pairs over Finite Fields
- The Splitting Subspace Conjecture
- Enumeration of Linear Transformation Shift Registers