Please use this identifier to cite or link to this item:
|Title:||A fast algorithm for determining the linear complexity of a sequence with period p n over G F (q)|
|Source:||Xiao, G.,Wei, S.,Lam, K.Y.,Imamura, K. (2000). A fast algorithm for determining the linear complexity of a sequence with period p n over G F (q). IEEE Transactions on Information Theory 46 (6) : 2203-2206. ScholarBank@NUS Repository. https://doi.org/10.1109/18.868492|
|Abstract:||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). © 2000 IEEE.|
|Source Title:||IEEE Transactions on Information Theory|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 12, 2017
checked on Dec 15, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.