作者
Guozhen Xiao, Shimin Wei, Kwok Yan Lam, Kyoki Imamura
发表日期
2000/9
期刊
IEEE Transactions on Information Theory
卷号
46
期号
6
页码范围
2203-2206
出版商
IEEE
简介
A fast algorithm is presented for determining the linear complexity of a sequence with period p/sup n/ over GF (q), where p is an odd prime, and where q is a prime and a primitive root (mod p/sup 2/).
引用总数
学术搜索中的文章
A fast algorithm for determining the linear complexity of a sequence with period p/sup n/over GF (q)
G Xiao, S Wei, KY Lam, K Imamura - IEEE Transactions on Information Theory, 2000