Solved and unsolved problems in number theory
Solved and unsolved problems in number theory
Modern computer algebra
On the linear complexity of Legendre sequences
IEEE Transactions on Information Theory
A relationship between linear complexity and k-error linear complexity
IEEE Transactions on Information Theory
A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q)
IEEE Transactions on Information Theory
Lower bounds on the linear complexity of the discrete logarithm in finite fields
IEEE Transactions on Information Theory
On the k-error linear complexity of sequences with period 2pn over GF(q)
Designs, Codes and Cryptography
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
On the k-error linear complexity of l-sequences
Finite Fields and Their Applications
On the linear complexity of binary threshold sequences derived from Fermat quotients
Designs, Codes and Cryptography
| Hi-index | 0.00 |
The k-error linear complexity of periodic binary sequences is defined to be the smallest linear complexity that can be obtained by changing k or fewer bits of the sequence per period. For the period length pn, where p is an odd prime and 2 is a primitive root modulo p2, we show 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. Moreover, we describe an algorithm to determine the k-error linear complexity of a given pn-periodic binary sequence.