Remarks on the \(k\)-error linear complexity of \(p^n\)-periodic sequences

DOI10.1007/s10623-006-9029-2zbMath1131.94010MaRDI QIDQ2383994

Ayineedi Venkateswarlu, Wilfried Meidl

Publication date: 20 September 2007

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

Full work available at URL: https://doi.org/10.1007/s10623-006-9029-2

zbMATH Keywords

\(k\)-error linear complexity; Linear complexity; Chan-Games algorithm

Mathematics Subject Classification ID

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

94A60: Cryptography

11B50: Sequences (mod (m))

Related Items

Distribution of one-error linear complexity of binary sequences for arbitrary prime period, Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity, Counting Functions for the k-Error Linear Complexity of 2 n -Periodic Binary Sequences

Cites Work

• Unnamed Item
• Analysis and design of stream ciphers
• Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
• 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
• On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
• Computing the error linear complexity spectrum of a binary sequence of period 2/sup n/
• Progress in Cryptology - INDOCRYPT 2003