Enumeration of linear transformation shift registers
From MaRDI portal
Publication:2340178
block companion matrixlinear feedback shift register (LFSR)self-reciprocal polynomialsplitting subspacetransformation shift register (TSR)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomials in general fields (irreducibility, etc.) (12E05) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Abstract: We consider the problem of counting the number of linear transformation shift registers (TSRs) of a given order over a finite field. We derive explicit formulae for the number of irreducible TSRs of order two. An interesting connection between TSRs and self-reciprocal polynomials is outlined. We use this connection and our results on TSRs to deduce a theorem of Carlitz on the number of self-reciprocal irreducible monic polynomials of a given degree over a finite field.
Recommendations
- On the number of irreducible linear transformation shift registers
- Linear transformation shift registers
- An asymptotic formula for the number of irreducible transformation shift registers
- scientific article; zbMATH DE number 2124951
- On the construction of irreducible self-reciprocal polynomials over finite fields
Cites work
- Block companion singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields
- Efficient linear feedback shift registers with maximal period
- Enumeration of Splitting Subspaces over Finite Fields
- Generalization of a theorem of Carlitz
- scientific article; zbMATH DE number 2124951 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- Linear transformation shift registers
- Necklaces, symmetries and self-reciprocal polynomials
- On irreducible polynomials of certain types in finite fields
- On the construction of irreducible self-reciprocal polynomials over finite fields
- On the number of matrices with given characteristic polynomial
- On the number of nilpotent matrices with coefficients in a finite field
- Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers
- Self-reciprocal polynomials over finite fields
- Some theorems on irreducible reciprocal polynomials over a finite field.
- The multiple-recursive matrix method for pseudorandom number generation
- The splitting subspace conjecture
- Word-oriented transformation shift registers and their linear complexity
Cited in
(13)- Nonlinear vectorial primitive recursive sequences
- A note on the multiple-recursive matrix method for generating pseudorandom vectors
- Unimodular polynomial matrices over finite fields
- Irreducible polynomials from a cubic transformation
- scientific article; zbMATH DE number 1594296 (Why is no real title available?)
- An Equivalence-Preserving Transformation of Shift Registers
- Linear transformation shift registers
- On Functions of Linear Shift Register Sequences
- scientific article; zbMATH DE number 2124951 (Why is no real title available?)
- An asymptotic formula for the number of irreducible transformation shift registers
- On the number of irreducible linear transformation shift registers
- Primitive transformation shift registers over finite fields
- scientific article; zbMATH DE number 5061999 (Why is no real title available?)
This page was built for publication: Enumeration of linear transformation shift registers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2340178)
