How many bits have to be changed to decrease the linear complexity?
From MaRDI portal
Publication:702172
DOI10.1023/B:DESI.0000035466.28660.e9zbMath1067.94011OpenAlexW2091317732MaRDI QIDQ702172
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
Symbolic computation and algebraic computation (68W30) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Sequences (mod (m)) (11B50)
Related Items (14)
Thek-error linear complexity and the linear complexity forpq n-periodic binary sequences ⋮ On the k-error linear complexity of binary sequences derived from polynomial quotients ⋮ Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\) ⋮ Complete characterization of the first descent point distribution for the \(k\)-error linear complexity of \(2^n\)-periodic binary sequences ⋮ Structure analysis on the \(k\)-error linear complexity for \(2^n\)-periodic binary sequences ⋮ On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory ⋮ On the \(k\)-error linear complexity of \(\ell\)-sequences ⋮ On the \(k\)-error linear complexity of sequences with period \(2p^{n}\) over \(GF(q)\) ⋮ On the linear complexity of binary threshold sequences derived from Fermat quotients ⋮ On the error linear complexity spectrum of \(p^n\)-periodic binary sequences ⋮ An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences ⋮ Joint linear complexity of multisequences consisting of linear recurring sequences ⋮ Lower bounds on error complexity measures for periodic LFSR and FCSR sequences ⋮ Additive character sums of polynomial quotients
This page was built for publication: How many bits have to be changed to decrease the linear complexity?
