Word-oriented transformation shift registers and their linear complexity

DOI10.1007/978-3-642-30615-0_18MaRDI QIDQ2907290zbMATH OpenOpenAlexFDO

Authors Sartaj Ul Hasan, Daniel Panario, Qiang Wang

Publication date 7 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-30615-0_18

zbMATH Keywords

linear complexitylinear feedback shift registerSinger cycletransformation shift registerLangford arrangementnonlinearly filtered primitive transformation shift register

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• Linear transformation shift registers
• Primitive transformation shift registers over finite fields
• Efficient linear feedback shift registers with maximal period
• On the number of irreducible linear transformation shift registers
• Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers

Cited in

(17)

• Representations of skew linear recurrent sequences of maximal period over finite field;Представления скрученных линейных рекуррентных последовательностей максимального периода над конечным полем
• Enumeration of linear transformation shift registers
• An asymptotic formula for the number of irreducible transformation shift registers
• Linear complexity of second order PN_sequences addition with single order PN_sequence in nonlinear filter generator
• Linear transformation shift registers
• On the frequency of symbols in sequences generated by nonlinear feedforward generators
• Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers
• An Equivalence-Preserving Transformation of Shift Registers
• A note on the multiple-recursive matrix method for generating pseudorandom vectors
• Skew \(\sigma\)-splittable linear recurrent sequences with maximal period
• On the number of irreducible linear transformation shift registers
• Primitive transformation shift registers over finite fields
• Regular Transformations of Data Words Through Origin Information
• Nonlinear vectorial primitive recursive sequences
• Investigating results and performance of search and construction algorithms for word-based LFSRs, \(\sigma\)-LFSRs
• New representaions of elements of skew linear recurrent sequences via trace function based on the noncommutative Hamilton-Cayley theorem
• Methods of construction of skew linear recurrent sequences with maximal period based on the Galois polynomials factorization in the ring of matrix polynomials

This page was built for publication: Word-oriented transformation shift registers and their linear complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907290)