Word-Oriented transformation shift registers and their linear complexity

  • Authors:
  • Sartaj Ul Hasan;Daniel Panario;Qiang Wang

  • Affiliations:
  • School of Mathematics and Statistics, Carleton University, Ottawa, Canada;School of Mathematics and Statistics, Carleton University, Ottawa, Canada;School of Mathematics and Statistics, Carleton University, Ottawa, Canada

  • Venue:
  • SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We discuss the problem of counting the number of primitive transformation shift registers and its equivalent formulation in terms of Singer cycles in a corresponding general linear group. We also introduce the notion of word-oriented nonlinearly filtered primitive transformation shift registers based on a Langford arrangement and study their linear complexity.