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
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
Special distribution of the shortest linear recurring sequences in Z/(p) field
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
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
| Hi-index | 754.96 |
The k-error linear complexity of a periodic binary sequence is defined to be the smallest linear complexity that can be obtained by changing k or fewer bits per period. This contribution focuses on the case of 2n-periodic binary sequences. For k=1,2, the exact formula for the expected k-error linear complexity of a sequence having maximal possible linear complexity 2n, and the exact formula of the expected 1-error linear complexity of a random 2n-periodic binary sequence are provided. For k ges 2, lower and upper bounds on the expected value of the k-error linear complexity of a random 2n-periodic binary sequence are established