Counting Functions for the k-Error Linear Complexity of 2 n -Periodic Binary Sequences

DOI10.1007/978-3-642-04159-4_10zbMath1256.94036OpenAlexW1482903488MaRDI QIDQ3644198

Ramakanth Kavuluru, Andrew Klapper

Publication date: 3 November 2009

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04159-4_10

zbMATH Keywords

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

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Sequences (mod (m)) (11B50)

Cites Work

• Analysis and design of stream ciphers
• Remarks on the \(k\)-error linear complexity of \(p^n\)-periodic sequences
• 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/
• A relationship between linear complexity and k-error linear complexity