Asymptotic analysis on the normalized \(k\)-error linear complexity of binary sequences
From MaRDI portal
Publication:664386
DOI10.1007/s10623-011-9519-8zbMath1243.94022OpenAlexW2094542733MaRDI QIDQ664386
Publication date: 1 March 2012
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-011-9519-8
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Sequences (mod (m)) (11B50)
Cites Work
- Unnamed Item
- Unnamed Item
- The asymptotic normalized linear complexity of multisequences
- Analysis and design of stream ciphers
- The stability theory of stream ciphers
- Counting functions and expected values for the \(k\)-error linear complexity
- The asymptotic behavior of \(N\)-adic complexity
- Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary Sequences
- Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
- Progress in Cryptology - INDOCRYPT 2003
- Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences
This page was built for publication: Asymptotic analysis on the normalized \(k\)-error linear complexity of binary sequences