Title :
Linear complexity for one-symbol substitution of a periodic sequence over GF(q)
Author :
Dai, Zongduo ; Imamura, Kyoki
Author_Institution :
Dept. of Math., Acad. Sinica, Beijing, China
fDate :
5/1/1998 12:00:00 AM
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
Keywords :
computational complexity; information theory; sequences; GF(q); linear complexity; minimal polynomial; one-symbol substitution; periodic sequence; Computer science; Information security; Laboratories; Mathematics; Polynomials;
Journal_Title :
Information Theory, IEEE Transactions on
