Please use this identifier to cite or link to this item: https://doi.org/10.1109/18.868492
Title: A fast algorithm for determining the linear complexity of a sequence with period p n over G F (q)
Authors: Xiao, G.
Wei, S.
Lam, K.Y. 
Imamura, K.
Keywords: Codes
Cryptography
Fast algorithm
Linear complexity
Periodic sequence
Issue Date: 2000
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
URI: http://scholarbank.nus.edu.sg/handle/10635/39066
ISSN: 00189448
DOI: 10.1109/18.868492
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

46
checked on Dec 12, 2017

Page view(s)

105
checked on Dec 15, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.