Some enumeration results on binary 2ⁿ-periodic sequences
DOI10.1142/S0129054117500113zbMATH Open1406.94016OpenAlexW2604140539MaRDI QIDQ4977893FDOQ4977893
Authors: Zuling Chang, Pinhui Ke, Yongcheng Zhao 
Publication date: 17 August 2017
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054117500113
Recommendations
- Properties of error linear complexity of binary sequences
- Some algorithms for the error linear complexity of binary \(2^n\)-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
linear complexityGames-Chan algorithmbinary periodic sequenceerror linear complexity spectrumStamp-Martin algorithm
Analysis of algorithms (68W40) Exact enumeration problems, generating functions (05A15) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Cites Work
- A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
- Shift-register synthesis and BCH decoding
- 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/
- A relationship between linear complexity and k-error linear complexity
- Properties of the Error Linear Complexity Spectrum
- On the Computation of the Linear Complexity and the<tex>$k$</tex>-Error Linear Complexity of Binary Sequences With Period a Power of Two
Cited In (1)
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)
