Primitive transformation shift registers over finite fields

DOI10.1142/S0219498819501718zbMath1435.94113arXiv1612.05367OpenAlexW2616829698MaRDI QIDQ5231717

Ambrish Awasthi, Rajendra K. Sharma

Publication date: 27 August 2019

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.05367

zbMATH Keywords

tracecharacteristic polynomialirreducible polynomialprimitive polynomialtransformation 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) Congruences; primitive roots; residue systems (11A07) Dynamical systems over finite ground fields (37P25)

Cites Work

• Unnamed Item
• Unnamed Item
• An asymptotic formula for the number of irreducible transformation shift registers
• 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
• On the number of matrices with given characteristic polynomial
• Efficient linear feedback shift registers with maximal period
• On the existence of a primitive quadratic of trace 1 over \(GF(p^ m)\)
• Enumeration of linear transformation shift registers
• The splitting subspace conjecture
• Word-Oriented Transformation Shift Registers and Their Linear Complexity
• Linear transformation shift registers

This page was built for publication: Primitive transformation shift registers over finite fields