On the number of irreducible linear transformation shift registers

DOI10.1007/s10623-016-0240-5zbMath1381.94053OpenAlexW2464951797MaRDI QIDQ522218

Yupeng Jiang, Jiangshuai Yang

Publication date: 13 April 2017

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-016-0240-5

zbMATH Keywords

Möbius inversion formulairreducible polynomiallinear feedback shift registertransformation shift register

Mathematics Subject Classification ID

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)

Related Items (3)

Nonlinear vectorial primitive recursive sequences ⋮ Unimodular polynomial matrices over finite fields ⋮ Irreducible polynomials from a cubic transformation

Cites Work

• Unnamed Item
• An asymptotic formula for the number of irreducible transformation shift registers
• The number of irreducible polynomials of a given form over a finite field
• 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
• Irreducible polynomials over a finite field and an analogue of Gauss sums over a field of characteristic 2
• The multiple-recursive matrix method for pseudorandom number generation
• A new criterion for permutation polynomials
• 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
• On the Number of Linear Feedback Shift Registers With a Special Structure

This page was built for publication: On the number of irreducible linear transformation shift registers