On the \(k\)-error linear complexity of \(\ell\)-sequences
From MaRDI portal
Publication:609360
DOI10.1016/j.ffa.2010.07.002zbMath1222.94027OpenAlexW2000057171MaRDI QIDQ609360
Publication date: 30 November 2010
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2010.07.002
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Cites Work
- Unnamed Item
- Unnamed Item
- How many bits have to be changed to decrease the linear complexity?
- Periods of termwise exclusive ors of maximal length FCSR sequences
- The stability theory of stream ciphers
- Feedback shift registers, 2-adic span, and combiners with memory
- On the linear complexity of FCSR sequences
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
- Arithmetic crosscorrelations of feedback with carry shift register sequences
- 2-Adic shift registers
- A relationship between linear complexity and k-error linear complexity
- A lower bound on the linear span of an FCSR
- Partial period distribution of FCSR sequences
- Autocorrelations of Maximum Period FCSR Sequences
This page was built for publication: On the \(k\)-error linear complexity of \(\ell\)-sequences