The \(k\)-error linear complexity distribution for \(2^n\)-periodic binary sequences

DOI10.1007/S10623-013-9805-8zbMath1355.94041arXiv1310.0132OpenAlexW2030744920MaRDI QIDQ2510654

Wanquan Liu, Jian-Qin Zhou

Publication date: 1 August 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.0132

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) Cryptography (94A60) Sequences (mod (m)) (11B50)

Related Items (4)

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 ⋮ On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory ⋮ Characterization of the Third Descent Points for the k-error Linear Complexity of $$2^n$$-periodic Binary Sequences

Cites Work

• A counterexample concerning the 3-error linear complexity of \(2^{n }\)-periodic binary sequences
• Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity
• Analysis and design of stream ciphers
• The stability theory of stream ciphers
• 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
• 2 n -Periodic Binary Sequences with Fixed k-Error Linear Complexity for k = 2 or 3
• 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

This page was built for publication: The \(k\)-error linear complexity distribution for \(2^n\)-periodic binary sequences