How Many Bits have to be Changed to Decrease the Linear Complexity?
Designs, Codes and Cryptography
Remarks on the k-error linear complexity of pn-periodic sequences
Designs, Codes and Cryptography
2n-Periodic Binary Sequences with Fixed k-Error Linear Complexity for k = 2 or 3
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
Linearization Method and Linear Complexity
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
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
Multisequences with large linear and k-error linear complexity from Hermitian function fields
IEEE Transactions on Information Theory
On the k-error linear complexity of sequences with period 2pn over GF(q)
Designs, Codes and Cryptography
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
The characterization of 2n-periodic binary sequences with fixed 1-error linear complexity
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
On the k-error linear complexity of l-sequences
Finite Fields and Their Applications
| Hi-index | 755.02 |
Linear complexity is an important cryptographic criterion of stream ciphers. The k-error linear complexity of a periodic sequence of period N is defined as the smallest linear complexity that can be obtained by changing k or fewer bits of the sequence per period. This article shows a relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity