Periodic multisequences with large error linear complexity
Designs, Codes and Cryptography
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
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
Computing the k-error N-adic complexity of a sequence of period pn
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Improved results on periodic multisequences with large error linear complexity
Finite Fields and Their Applications
| Hi-index | 754.96 |
We establish the existence of periodic sequences over a finite field which simultaneously achieve the maximum value (for the given period length) of the linear complexity and of the k-error linear complexity for small values of k. This disproves a conjecture of Ding, Xiao, and Shan (1991). The result is of relevance for the theory of stream ciphers.