Computing the linear complexity for sequences with characteristic polynomial f^v
From MaRDI portal
Publication:2392687
Recommendations
- 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 1955778
- Linear complexity of periodic sequences: a general theory
- Fast algorithms for determining the linear complexities of sequences over \(GF(p^{m})\) with the period \(3 n\)
- Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm
Cites work
- scientific article; zbMATH DE number 607286 (Why is no real title available?)
- A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
- How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences
- On the Computation of the Linear Complexity and the<tex>$k$</tex>-Error Linear Complexity of Binary Sequences With Period a Power of Two
- Shift Register Sequences – A Retrospective Account
- The stability theory of stream ciphers
Cited in
(2)
This page was built for publication: Computing the linear complexity for sequences with characteristic polynomial \(f^v\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392687)
