Characterization of the third descent points for the k-error linear complexity of 2ⁿ-periodic binary sequences

DOI10.1007/978-3-319-29814-6_14zbMATH Open1384.94020OpenAlexW2471326751MaRDI QIDQ2801767FDOQ2801767

Authors: Xifeng Wang, Jianqin 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

Recommendations

• Complete characterization of the first descent point distribution for the \(k\)-error linear complexity of \(2^n\)-periodic binary sequences
• Structure analysis on the \(k\)-error linear complexity for \(2^n\)-periodic binary sequences
• \(2^n\)-periodic binary sequences with 8-error linear complexity as the second descent point
• scientific article; zbMATH DE number 6262500
• Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity

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

• Analysis and design of stream ciphers
• The stability theory of stream ciphers
• A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
• The \(k\)-error linear complexity distribution for \(2^n\)-periodic binary sequences
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• 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
• Distribution of one-error linear complexity of binary sequences for arbitrary prime period
• Properties of the Error Linear Complexity Spectrum
• Cube theory and stable \(k\)-error linear complexity for periodic sequences

Cited In (3)

• \(2^n\)-periodic binary sequences with 8-error linear complexity as the second descent point
• Complete characterization of the first descent point distribution for the \(k\)-error linear complexity of \(2^n\)-periodic binary sequences
• Structure analysis on the \(k\)-error linear complexity for \(2^n\)-periodic binary sequences

This page was built for publication: Characterization of the third descent points for the \(k\)-error linear complexity of \(2^n\)-periodic binary sequences

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