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

10.1109/18.868492

Saved in:
Bibliographic Details
Main Authors: Xiao, G., Wei, S., Lam, K.Y., Imamura, K.
Other Authors: COMPUTER SCIENCE
Format: Article
Published: 2013
Subjects:
Online Access:http://scholarbank.nus.edu.sg/handle/10635/39066
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: National University of Singapore
id sg-nus-scholar.10635-39066
record_format dspace
spelling sg-nus-scholar.10635-390662015-01-07T02:42:06Z A fast algorithm for determining the linear complexity of a sequence with period p n over G F (q) Xiao, G. Wei, S. Lam, K.Y. Imamura, K. COMPUTER SCIENCE Codes Cryptography Fast algorithm Linear complexity Periodic sequence 10.1109/18.868492 IEEE Transactions on Information Theory 46 6 2203-2206 IETTA 2013-07-04T07:33:11Z 2013-07-04T07:33:11Z 2000 Article 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. <a href="https://doi.org/10.1109/18.868492" target="_blank">https://doi.org/10.1109/18.868492</a> 00189448 http://scholarbank.nus.edu.sg/handle/10635/39066 NOT_IN_WOS Scopus
institution National University of Singapore
building NUS Library
country Singapore
collection ScholarBank@NUS
topic Codes
Cryptography
Fast algorithm
Linear complexity
Periodic sequence
spellingShingle Codes
Cryptography
Fast algorithm
Linear complexity
Periodic sequence
Xiao, G.
Wei, S.
Lam, K.Y.
Imamura, K.
A fast algorithm for determining the linear complexity of a sequence with period p n over G F (q)
description 10.1109/18.868492
author2 COMPUTER SCIENCE
author_facet COMPUTER SCIENCE
Xiao, G.
Wei, S.
Lam, K.Y.
Imamura, K.
format Article
author Xiao, G.
Wei, S.
Lam, K.Y.
Imamura, K.
author_sort Xiao, G.
title A fast algorithm for determining the linear complexity of a sequence with period p n over G F (q)
title_short A fast algorithm for determining the linear complexity of a sequence with period p n over G F (q)
title_full A fast algorithm for determining the linear complexity of a sequence with period p n over G F (q)
title_fullStr A fast algorithm for determining the linear complexity of a sequence with period p n over G F (q)
title_full_unstemmed A fast algorithm for determining the linear complexity of a sequence with period p n over G F (q)
title_sort fast algorithm for determining the linear complexity of a sequence with period p n over g f (q)
publishDate 2013
url http://scholarbank.nus.edu.sg/handle/10635/39066
_version_ 1681082030169784320