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

Authors
Xiao, GZ Wei, SM Lam, KY Imamura, K
Citation
Gz. Xiao et al., A fast algorithm for determining the linear complexity of a sequence with period p(n) over GF (q), IEEE INFO T, 46(6), 2000, pp. 2203-2206
Citations number
11
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
IEEE TRANSACTIONS ON INFORMATION THEORY
ISSN journal
00189448 → ACNP
Volume
46
Issue
6
Year of publication
2000
Pages
2203 - 2206
Database
ISI
SICI code
0018-9448(200009)46:6<2203:AFAFDT>2.0.ZU;2-N
Abstract
A fast algorithm is presented for determining the linear complexity of a se quence with period p(n) over GF (q), where p is an odd prime, and where q i s a prime and a primitive root (mod p(2)).