Computing the linear complexity for sequences with characteristic polynomial f^v
DOI10.1007/S12095-013-0080-3zbMATH Open1271.94015OpenAlexW2121360584MaRDI QIDQ2392687FDOQ2392687
Authors: Alex J. Burrage, Raphael C.-W. Phan, Ana Sălăgean 
Publication date: 2 August 2013
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-013-0080-3
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
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Cites Work
- Title not available (Why is that?)
- The stability theory of stream ciphers
- Shift Register Sequences – A Retrospective Account
- A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
- On the Computation of the Linear Complexity and the<tex>$k$</tex>-Error Linear Complexity of Binary Sequences With Period a Power of Two
- How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences
Cited In (1)
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)
