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:
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 |
Similar Items
-
The characterization of 2n-periodic binary sequences with fixed 1-error linear complexity
by: Fu, F.-W., et al.
Published: (2014) -
On the linear complexity of Legendre sequences
by: Ding, C., et al.
Published: (2014) -
Periodic sequences with maximal linear complexity and large k-error linear complexity
by: Meidl, W., et al.
Published: (2014) -
On the stability of 2n-periodic binary sequences
by: Meidl, W.
Published: (2016) -
How many bits have to be changed to decrease the linear complexity?
by: Meidl, W.
Published: (2016)