Distribution of one-error linear complexity of binary sequences for arbitrary prime period
From MaRDI portal
Publication:394411
DOI10.1007/S11424-012-1101-6zbMath1298.94074OpenAlexW2061178108MaRDI QIDQ394411
Publication date: 27 January 2014
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-012-1101-6
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items (1)
Cites Work
- Analysis and design of stream ciphers
- The stability theory of stream ciphers
- Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
- Remarks on the \(k\)-error linear complexity of \(p^n\)-periodic sequences
- A fast algorithm for determining the linear complexity of a sequence with period p/sup n/ over GF(q)
- 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
- On the $k$-Error Linear Complexity of $p^{m}$-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/
- On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
- Periodic sequences with large k-error linear complexity
- Properties of the Error Linear Complexity Spectrum
- New Results on Periodic Sequences With Large $k$-Error Linear Complexity
- Cryptography and Coding
- Shift-register synthesis and BCH decoding
This page was built for publication: Distribution of one-error linear complexity of binary sequences for arbitrary prime period
