The characterization of 2n-periodic binary sequences with fixed 1-error linear complexity
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Saved in:
Main Authors: | Fu, F.-W., Niederreiter, H., Su, M. |
---|---|
Other Authors: | TEMASEK LABORATORIES |
Format: | Conference or Workshop Item |
Published: |
2014
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/111649 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
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) -
On the expected value of the linear complexity and the κ-error linear complexity of periodic sequences
by: Meidl, W., et al.
Published: (2014) -
How many bits have to be changed to decrease the linear complexity?
by: Meidl, W.
Published: (2016) -
Counting functions and expected values for the k-error linear complexity
by: Meidl, W., et al.
Published: (2014)