On evaluating the linear complexity of a sequence of least period 2^ n
From MaRDI portal
(Redirected from Publication:1329115)
On evaluating the linear complexity of a sequence of least period \(2^ n\)
On evaluating the linear complexity of a sequence of least period \(2^ n\)
Recommendations
- Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm
- Fast Algorithms for Determining the Linear Complexity of Sequences Over<tex>$hboxGF,(p^m)$</tex>With Period<tex>$2^tn$</tex>
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
- scientific article; zbMATH DE number 26870
- scientific article; zbMATH DE number 1955778
Cites work
- A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
- Analysis and design of stream ciphers
- scientific article; zbMATH DE number 3204642 (Why is no real title available?)
- On the complexities of de-Bruijn sequences
- Shift-register synthesis and BCH decoding
Cited in
(6)- Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm
- Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences.
- Linear complexity of periodic sequences: a general theory
- Fast Algorithms for Determining the Linear Complexity of Sequences Over<tex>$hboxGF,(p^m)$</tex>With Period<tex>$2^tn$</tex>
- scientific article; zbMATH DE number 25605 (Why is no real title available?)
- Sequences with good correlation property based on depth and interleaving techniques
This page was built for publication: On evaluating the linear complexity of a sequence of least period \(2^ n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329115)
