Analysis and design of stream ciphers
Analysis and design of stream ciphers
Linear complexity, k-error linear complexity, and the discrete Fourier transform
Journal of Complexity
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
A relationship between linear complexity and k-error linear complexity
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Computing the error linear complexity spectrum of a binary sequence of period 2n
IEEE Transactions on Information Theory
On the stability of 2n-periodic binary sequences
IEEE Transactions on Information Theory
Characterization of 2n-periodic binary sequences with fixed 2-error or 3-error linear complexity
Designs, Codes and Cryptography
Properties of the error linear complexity spectrum
IEEE Transactions on Information Theory
New results on periodic sequences with large k-error linear complexity
IEEE Transactions on Information Theory
| Hi-index | 0.12 |
Recently the first author presented exact formulas for the number of 2 n -periodic binary sequences with given 1-error linear complexity, and an exact formula for the expected 1-error linear complexity and upper and lower bounds for the expected k-error linear complexity, k 驴 2, of a random 2 n -periodic binary sequence. A crucial role for the analysis played the Chan---Games algorithm. We use a more sophisticated generalization of the Chan---Games algorithm by Ding et al. to obtain exact formulas for the counting function and the expected value for the 1-error linear complexity for p n -periodic sequences over $${\mathbb{F}_{p, p}}$$ prime. Additionally we discuss the calculation of lower and upper bounds on the k-error linear complexity of p n -periodic sequences over $${\mathbb{F}_{p}}$$ .