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

IEEE Transactions on Information Theory

Volumn 44, Issue 3, 1998, Pages 1328-1331

  Dai, Zongduo ^a   Imamura, Kyoki ^b  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Linear complexity; One symbol substitution; Periodic sequences over GF(q)

Indexed keywords

CODES (SYMBOLS); INFORMATION THEORY; POLYNOMIALS; SET THEORY;

LINEAR COMPLEXITY; ONE SYMBOL SUBSTITUTION; PERIODIC SEQUENCE;

COMPUTATIONAL COMPLEXITY;

EID: 0032073303     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.669427     Document Type: Article

References (5)

1. K. Imamura, T. Moriuchi, and S. Uehara, "Periodic sequences of the maximum linear complexity simply obtained from an m-sequence," in Proc. IEEE 1991 Int. Symp. Information Theory, June 1991, p. 175.
2. K. Imamura and G. Xiao, "On periodic sequences of the maximum linear complexity and m-sequences," in Proc. ISITA 1992, Nov. 1992, pp. 1219-1221.
3. n - 1 with maximum linear complexity and maximum order complexities for minimum changes of m-sequences," in Proc. IEEE 1994 Int. Symp. Information Theory, June 1994, p. 366.
4. W. H. Mills, "Continued fractions and linear recurrences," Math. Comp., vol. 29, pp. 173-180, 1975.
5. Z. D. Dai, X. N. Feng, M. L. Liu, and Z. X. Wan, "Nonlinear feedforward sequences of m-sequences I," Discr. Math., vol. 123, pp. 17-34, 1993.