On the Computation of the Linear Complexity and the<tex>$k$</tex>-Error Linear Complexity of Binary Sequences With Period a Power of Two
From MaRDI portal
Publication:3547576
DOI10.1109/TIT.2004.842769zbMath1280.94033OpenAlexW2135958641MaRDI QIDQ3547576
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2004.842769
Symbolic computation and algebraic computation (68W30) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Decoding (94B35)
Related Items (5)
Computing the linear complexity for sequences with characteristic polynomial \(f^v\) ⋮ Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences ⋮ An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences ⋮ Some Enumeration Results on Binary 2n-Periodic Sequences ⋮ How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences
This page was built for publication: On the Computation of the Linear Complexity and the<tex>$k$</tex>-Error Linear Complexity of Binary Sequences With Period a Power of Two
