Welcome to Journal of University of Chinese Academy of Sciences,Today is

›› 2000, Vol. 17 ›› Issue (2): 9-12.

Previous Articles     Next Articles

Linear Complexities of SequencesObtained from Periodic Sequences over Fq by Two-Symbol Substitution

Ye Dingfeng, Dai Zongduo   

  1. State Key Laboratory of Information Security, Graduate School, University of Science and Technology of China, Beijing 100039
  • Received:2000-10-13 Online:2000-03-15

Abstract:

An expression of the linear complexity of a periodic sequence under andy 2-symbol subst itution and a tight lower bound of the linear complexity of an m-sequence under the 2-symbol substitutions are given.

Key words: inear comlexity, m-sequence, periodic sequence

CLC Number: