Some Enumeration Results on Binary 2n-Periodic Sequences
DOI10.1142/S0129054117500113zbMath1406.94016OpenAlexW2604140539MaRDI QIDQ4977893
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
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
- On the Computation of the Linear Complexity and the<tex>$k$</tex>-Error Linear Complexity of Binary Sequences With Period a Power of Two
- A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
- A relationship between linear complexity and k-error linear complexity
- Computing the error linear complexity spectrum of a binary sequence of period 2/sup n/
- Properties of the Error Linear Complexity Spectrum
- Shift-register synthesis and BCH decoding
This page was built for publication: Some Enumeration Results on Binary 2n-Periodic Sequences
