Linear complexity for one-symbol substitution of a periodic sequence over GF(q)

Authors:
Zongduo Dai;K. Imamura
Affiliations:
Dept. of Math., Acad. Sinica, Beijing;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 4

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

IEEE Transactions on Information Theory
On the k-operation linear complexity of periodic sequences

INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Stability of the linear complexity of the generalized self-shrinking sequences

CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
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

Quantified Score

Hi-index	754.90

Visualization

Abstract

It is shown that the linear complexity for one-symbol substitution of any periodic sequence over GF(q) can be computed without any condition on the minimal polynomial of the sequence