Word-Oriented Transformation Shift Registers and Their Linear Complexity
- Cite this paper as:
- Hasan S.U., Panario D., Wang Q. (2012) Word-Oriented Transformation Shift Registers and Their Linear Complexity. In: Helleseth T., Jedwab J. (eds) Sequences and Their Applications – SETA 2012. SETA 2012. Lecture Notes in Computer Science, vol 7280. Springer, Berlin, Heidelberg
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.
KeywordsLinear feedback shift register Singer cycle transformation shift register linear complexity Langford arrangement nonlinearly filtered primitive transformation shift register
Unable to display preview. Download preview PDF.