Properties of error linear complexity of binary sequences

MaRDI QIDQ2824736zbMATH OpenFDO

Authors Zuling Chang, Ning Wang

Publication date 6 October 2016

Published in Journal of Zhengzhou University. Natural Science Edition (Search for Journal in Brave)

zbMATH Keywords

binary sequencecritical pointerror linear complexityGames-Chan algorithm

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• scientific article; zbMATH DE number 6262500
• The 4 (or 5)-error sequences of 2ⁿ-periodic binary sequences with linear complexity 2ⁿ-2ᵐ
• On the 2-error linear complexity of 2ⁿ-periodic balanced binary sequences
• The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/

Cited in

(4)

• Some enumeration results on binary 2ⁿ-periodic sequences
• The properties of external control sequences
• An algorithm for computing all the critical points of exponent periodic sequences
• scientific article; zbMATH DE number 4187707 (Why is no real title available?)

This page was built for publication: Properties of error linear complexity of binary sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2824736)