Pages that link to "Item:Q3547576"
From MaRDI portal
The following pages link to On the Computation of the Linear Complexity and the<tex>$k$</tex>-Error Linear Complexity of Binary Sequences With Period a Power of Two (Q3547576):
Displaying 5 items.
- An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences (Q742512) (← links)
- How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences (Q1032492) (← links)
- Computing the linear complexity for sequences with characteristic polynomial \(f^v\) (Q2392687) (← links)
- Some Enumeration Results on Binary 2<sup>n</sup>-Periodic Sequences (Q4977893) (← links)
- Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences (Q5447518) (← links)
