Characterization of the Third Descent Points for the k-error Linear Complexity of $$2^n$$-periodic Binary Sequences

DOI10.1007/978-3-319-29814-6_14zbMath1384.94020OpenAlexW2471326751MaRDI QIDQ2801767

Xi-Feng Wang, Jian-Qin Zhou, Wanquan Liu

Publication date: 21 April 2016

Published in: Information and Communications Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-29814-6_14

zbMATH Keywords

linear complexityperiodic sequence\(k\)-error linear complexity\(k\)-error linear complexity distribution

Mathematics Subject Classification ID

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

Cites Work

• Distribution of one-error linear complexity of binary sequences for arbitrary prime period
• Analysis and design of stream ciphers
• The stability theory of stream ciphers
• The \(k\)-error linear complexity distribution for \(2^n\)-periodic binary sequences
• Cube Theory and Stable $$k$$-Error Linear Complexity for Periodic Sequences
• The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity
• On the Stability of<tex>$2^n$</tex>-Periodic Binary Sequences
• 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/
• Properties of the Error Linear Complexity Spectrum

This page was built for publication: Characterization of the Third Descent Points for the k-error Linear Complexity of $$2^n$$-periodic Binary Sequences