Linear complexity, k-error linear complexity, and the discrete Fourier transform
10.1006/jcom.2001.0621
Saved in:
Main Authors: | Meidl, W., Niederreiter, H. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/103493 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
On the expected value of the linear complexity and the κ-error linear complexity of periodic sequences
by: Meidl, W., et al.
Published: (2014) -
Periodic sequences with maximal linear complexity and large k-error linear complexity
by: Meidl, W., et al.
Published: (2014) -
Periodic sequences with large k-error linear complexity
by: Niederreiter, H.
Published: (2014) -
Counting functions and expected values for the k-error linear complexity
by: Meidl, W., et al.
Published: (2014) -
How many bits have to be changed to decrease the linear complexity?
by: Meidl, W.
Published: (2016)