Distribution of one-error linear complexity of binary sequences for arbitrary prime period
DOI10.1007/S11424-012-1101-6zbMATH Open1298.94074OpenAlexW2061178108MaRDI QIDQ394411FDOQ394411
Authors: Lin Tan, Hong Xu, Wenfeng Qi
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
Recommendations
- 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
- scientific article; zbMATH DE number 5651473
- \(k\)-error linear complexity distribution of \(2^n\)-periodic binary sequences with linear complexity \(2^n-9\)
- The distribution of \(2^n\)-periodic binary sequences with fixed \(k\)-error linear complexity
Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)
Cites Work
- Analysis and design of stream ciphers
- The stability theory of stream ciphers
- A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
- On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
- Shift-register synthesis and BCH decoding
- A fast algorithm for determining the linear complexity of a sequence with period \(p^n\) over GF\((q)\)
- On the $k$-Error Linear Complexity of $p^{m}$-Periodic Binary Sequences
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
- Periodic sequences with large k-error linear complexity
- Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
- 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
- Properties of the Error Linear Complexity Spectrum
- New Results on Periodic Sequences With Large $k$-Error Linear Complexity
- Cryptography and Coding
Cited In (3)
This page was built for publication: Distribution of one-error linear complexity of binary sequences for arbitrary prime period
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394411)