An asymptotic formula for the number of irreducible transformation shift registers
DOI10.1016/j.laa.2015.06.020zbMath1330.05018arXiv1506.02548OpenAlexW1535558765MaRDI QIDQ491103
Daniel Panario, Stephen D. Cohen, Sartaj Ul Hasan, Qiang Wang
Publication date: 24 August 2015
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.02548
Galois groupcharacteristic polynomialirreducible polynomialprimitive polynomialblock companion matrixtransformation shift register
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) Finite fields (field-theoretic aspects) (12E20) Asymptotic enumeration (05A16)
Related Items (10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- The multiple-recursive matrix method for pseudorandom number generation
- Efficient linear feedback shift registers with maximal period
- Enumeration of linear transformation shift registers
- The splitting subspace conjecture
- Word-Oriented Transformation Shift Registers and Their Linear Complexity
- Linear transformation shift registers
- Some theorems on irreducible reciprocal polynomials over a finite field.
- The distribution of polynomials over finite fields
- Uniform Distribution of Polynomials Over Finite Fields
This page was built for publication: An asymptotic formula for the number of irreducible transformation shift registers