Some enumeration results on binary 2ⁿ-periodic sequences
From MaRDI portal
Publication:4977893
Recommendations
- Properties of error linear complexity of binary sequences
- Some algorithms for the error linear complexity of binary 2ⁿ-periodic sequences
- On the 2-error linear complexity of \(2^n\)-periodic balanced binary sequences
- An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences
- Counting functions for \(2^n\)-periodic binary sequences with 4-error linear complexity
Cites work
- A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
- A relationship between linear complexity and k-error linear complexity
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
- Computing the error linear complexity spectrum of a binary sequence of period 2/sup n/
- On the Computation of the Linear Complexity and the<tex>$k$</tex>-Error Linear Complexity of Binary Sequences With Period a Power of Two
- Properties of the Error Linear Complexity Spectrum
- Shift-register synthesis and BCH decoding
This page was built for publication: Some enumeration results on binary \(2^n\)-periodic sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4977893)
