Primitive transformation shift registers over finite fields
arXiv:1612.05367 · doi:10.1142/S0219498819501718
Abstract
We consider the problem of existence and enumeration of primitive TSRs of order n over any finite field. Here we prove the existence of primitive TSRs of order two over finite fields of characteristic two and establish an equivalence between primitive TSRs and primitive polynomials of special form. A conjecture regarding the existence of these special type of primitive polynomials is submitted by us along with some experimental verification. Further we have attempted to enumerate primitive TSRs of order two over finite fields of characteristic two. Finally we give a general search algorithm for primitive TSRs of odd order over any finite field and in particular of order two over fields of characteristic two.
arXiv comment18 pages. arXiv admin note: substantial text overlap with arXiv:1603.08722; text overlap with arXiv:1506.02548 by other authors
References in corpus (6)
- 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
- An asymptotic formula for the number of irreducible transformation shift registers
- Enumeration of Linear Transformation Shift Registers