An algorithm for the k-error linear complexity of sequences over GF(pm) with period pn, p a prime

Fast Algorithms for Determining the Linear Complexity of Period Sequences

INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology

New results on periodic sequences with large k-error linear complexity

IEEE Transactions on Information Theory

A novel complexity metric of FH/SS sequences using approximate entropy

WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference

Modified Berlekamp-Massey algorithm for approximating the k-error linear complexity of binary sequences

Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding

Complexity measure of FH/SS sequences using approximate entropy

ICC'09 Proceedings of the 2009 IEEE international conference on Communications

An improved approximation algorithm for computing the k-error linear complexity of sequences using the discrete fourier transform

SETA'10 Proceedings of the 6th international conference on Sequences and their applications

On the k-error linear complexity of sequences with period 2pn over GF(q)

Designs, Codes and Cryptography

On the generalized Lauder-Paterson algorithm and profiles of the k-error linear complexity for exponent periodic sequences

SETA'04 Proceedings of the Third international conference on Sequences and Their Applications

On the computation of the linear complexity and the k-error linear complexity of binary sequences with period a power of two

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

On the stability of m-sequences

IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding