Reducing the calculation of the linear complexity of u₂^v-periodic binary sequences to Games-Chan algorithm

DOI10.1007/S10623-007-9134-XzbMATH Open1178.94179OpenAlexW1985421175MaRDI QIDQ1008964FDOQ1008964

Authors: Wilfried Meidl 

Publication date: 31 March 2009

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

Full work available at URL: https://doi.org/10.1007/s10623-007-9134-x

Recommendations

• The linear complexity of a class of binary sequences with period \(2p\)
• Some algorithms for the error linear complexity of binary \(2^n\)-periodic sequences
• A fast algorithm for determining the linear complexity of a binary sequence with period \(2^np^m\)
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• An algorithm for the \(k\)-error linear complexity of binary sequences with period \(2p^m\)
• The linear complexity of binary sequences with period (2/sup n/-1)/sup k/
• The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity
• On the $k$-Error Linear Complexity of $p^{m}$-Periodic Binary Sequences
• On the calculation of the linear complexity of periodic sequences
• On evaluating the linear complexity of a sequence of least period \(2^ n\)

Mathematics Subject Classification ID

Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Sequences (mod (m)) (11B50)

Cites Work

• Analysis and design of stream ciphers
• The stability theory of stream ciphers
• A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
• Title not available (Why is that?)
• Shift-register synthesis and BCH decoding
• A fast algorithm for determining the linear complexity of a sequence with period \(p^n\) over GF\((q)\)
• Progress in Cryptology - INDOCRYPT 2003
• The expected value of the joint linear complexity of periodic multisequences
• Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences
• Title not available (Why is that?)
• Fast Algorithms for Determining the Linear Complexity of Sequences Over<tex>$hboxGF,(p^m)$</tex>With Period<tex>$2^tn$</tex>
• Reducing the Computation of Linear Complexities of Periodic Sequences Over ${\hbox {GF}}(p^m)$

Cited In (6)

• Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences.
• Quadratic functions with prescribed spectra
• How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences
• Computing the linear complexity for sequences with characteristic polynomial \(f^v\)
• On the stability of periodic binary sequences with zone restriction
• On evaluating the linear complexity of a sequence of least period \(2^ n\)

This page was built for publication: Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm

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