How many bits have to be changed to decrease the linear complexity?
DOI10.1023/B:DESI.0000035466.28660.E9zbMATH Open1067.94011OpenAlexW2091317732MaRDI QIDQ702172FDOQ702172
Authors: Wilfried Meidl 
Publication date: 17 January 2005
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:desi.0000035466.28660.e9
Recommendations
- scientific article; zbMATH DE number 5651473
- Counting Functions for the k-Error Linear Complexity of 2 n -Periodic Binary Sequences
- A relationship between linear complexity and k-error linear complexity
- 2 n -Periodic Binary Sequences with Fixed k-Error Linear Complexity for k = 2 or 3
- On the Stability of<tex>$2^n$</tex>-Periodic Binary Sequences
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Sequences (mod (m)) (11B50)
Cited In (16)
- Thek-error linear complexity and the linear complexity forpq n-periodic binary sequences
- On the \(k\)-error linear complexity of sequences with period \(2p^{n}\) over \(GF(q)\)
- Joint linear complexity of multisequences consisting of linear recurring sequences
- Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\)
- On the k-error linear complexity of binary sequences derived from polynomial quotients
- How Much Can Complexity of Linear Cryptanalysis Be Reduced?
- On the \(k\)-error linear complexity of \(\ell\)-sequences
- An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences
- A relationship between linear complexity and k-error linear complexity
- On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory
- Lower bounds on error complexity measures for periodic LFSR and FCSR sequences
- Complete characterization of the first descent point distribution for the \(k\)-error linear complexity of \(2^n\)-periodic binary sequences
- Additive character sums of polynomial quotients
- Structure analysis on the \(k\)-error linear complexity for \(2^n\)-periodic binary sequences
- On the error linear complexity spectrum of \(p^n\)-periodic binary sequences
- On the linear complexity of binary threshold sequences derived from Fermat quotients
This page was built for publication: How many bits have to be changed to decrease the linear complexity?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q702172)
