Enumeration of linear transformation shift registers
DOI10.1007/s10623-013-9913-5zbMath1331.94046arXiv1208.2500OpenAlexW3098167917MaRDI QIDQ2340178
Publication date: 16 April 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.2500
linear feedback shift register (LFSR)block companion matrixsplitting subspaceself-reciprocal polynomialtransformation shift register (TSR)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Polynomials in general fields (irreducibility, etc.) (12E05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Generalization of a theorem of Carlitz
- On the number of matrices with given characteristic polynomial
- On the number of nilpotent matrices with coefficients in a finite field
- Necklaces, symmetries and self-reciprocal polynomials
- The multiple-recursive matrix method for pseudorandom number generation
- Efficient linear feedback shift registers with maximal period
- On the construction of irreducible self-reciprocal polynomials over finite fields
- The splitting subspace conjecture
- Word-Oriented Transformation Shift Registers and Their Linear Complexity
- Linear transformation shift registers
- Enumeration of Splitting Subspaces over Finite Fields
- Some theorems on irreducible reciprocal polynomials over a finite field.
- On irreducible polynomials of certain types in finite fields
- Self-reciprocal polynomials over finite fields
This page was built for publication: Enumeration of linear transformation shift registers