Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2001, Vol. 24 ›› Issue (2): 1-4.

    Next Articles

On the Linear Complexity of Products of LFSR Sequence on Residue Ring Z/(2e)

ZHANG Chun-qi, YANG Yi-xian, CAI Ji-ren   

  1. Information Engineering School,Beijing University of Posts and Telecommunications,Beijing 100876, China
  • Received:2000-12-20 Online:2001-03-10

Abstract: It is proved that the linear complexity of the production sequence of two LFSR sequences is less than or equal to the production of the linear complexities of the two LFSR sequences.Especially, if these two LFSR sequences are m-sequences, and if their minimal polynomials are mutually prime, then the linear complexity of the production sequence of the two LFSR sequences equals the production of the two linear complexities.

Key words: linear complexity, maximum sequences, Arithmetic result

CLC Number: