A fast algorithm for determining the linear complexity of a sequence with period <i>p<SUP>n</SUP></i> over GF (<i>q</i>)

作     者：Xiao, GZ Wei, SM Lam, KY Imamura, K 

作者机构：Xidian Univ Natl Key Lab ISN Xian 710071 Peoples R China Natl Univ Singapore Sch Comp Singapore 119260 Singapore Kyushu Inst Technol Dept Comp Sci & Elect Iizuka Fukuoka 820 Japan 

出 版 物：《IEEE TRANSACTIONS ON INFORMATION THEORY》 (IEEE Trans. Inf. Theory)

年 卷 期：2000年第46卷第6期

页      面：2203-2206页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：codes cryptography fast algorithm linear complexity periodic sequence 

摘      要：A fast algorithm is presented for determining the linear complexity of a sequence with period p(n) over GF (q), where p is an odd prime, and where q is a prime and a primitive root (mod p(2)).