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. |
---|---|
其他作者: | TEMASEK LABORATORIES |
格式: | Conference or Workshop Item |
出版: |
2014
|
主題: | |
在線閱讀: | http://scholarbank.nus.edu.sg/handle/10635/111649 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | National University of Singapore |
相似書籍
-
Periodic sequences with maximal linear complexity and large k-error linear complexity
由: Meidl, W., et al.
出版: (2014) -
Periodic sequences with large k-error linear complexity
由: Niederreiter, H.
出版: (2014) -
On the expected value of the linear complexity and the κ-error linear complexity of periodic sequences
由: Meidl, W., et al.
出版: (2014) -
How many bits have to be changed to decrease the linear complexity?
由: Meidl, W.
出版: (2016) -
Counting functions and expected values for the k-error linear complexity
由: Meidl, W., et al.
出版: (2014)