Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity
From MaRDI portal
Publication:1035809
DOI10.1007/s10623-009-9295-xzbMath1174.94010OpenAlexW2055170485MaRDI QIDQ1035809
Publication date: 4 November 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-009-9295-x
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items (3)
Complete characterization of the first descent point distribution for the \(k\)-error linear complexity of \(2^n\)-periodic binary sequences ⋮ A counterexample concerning the 3-error linear complexity of \(2^{n }\)-periodic binary sequences ⋮ The \(k\)-error linear complexity distribution for \(2^n\)-periodic binary sequences
Cites Work
- Unnamed Item
- Analysis and design of stream ciphers
- The stability theory of stream ciphers
- Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
- Counting functions and expected values for the \(k\)-error linear complexity
- Remarks on the \(k\)-error linear complexity of \(p^n\)-periodic sequences
- 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
- On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
- Shift-register synthesis and BCH decoding
This page was built for publication: Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity
