2 n -Periodic Binary Sequences with Fixed k-Error Linear Complexity for k = 2 or 3
From MaRDI portal
Publication:3600446
DOI10.1007/978-3-540-85912-3_23zbMath1206.94037OpenAlexW1584016986MaRDI QIDQ3600446
Publication date: 10 February 2009
Published in: Sequences and Their Applications - SETA 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85912-3_23
Related Items
Distribution of one-error linear complexity of binary sequences for arbitrary prime period, The \(k\)-error linear complexity distribution for \(2^n\)-periodic binary sequences, Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity
Cites Work
- Unnamed Item
- 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
- 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
