On the Second Descent Points for the K-Error Linear Complexity of 2n-Periodic Binary Sequences

DOI

10.2991/cimns-16.2016.77How to use a DOI?

Keywords

periodic sequence; linear complexity; k-error linear complexity; k-error linear complexity distribution

Abstract

In this paper, a constructive approach for determining CELCS (critical error linear complexity spectrum) for the k-error linear complexity distribution of 2n-periodic binary sequences is developed via the sieve method and Games-Chan algorithm. Accordingly, the second descent point (critical point) distribution of the k-error linear complexity for 2n-periodic binary sequences is characterized. As a by product, it is proved that the maximum k-error linear complexity is 2n-(2l-1) over all 2n-periodic binary sequences, where 2l-1<=k < 2l and l < n. With these results, some work by Niu et al. are proved to be incorrect.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Jianqin Zhou
AU  - Xifeng Wang
AU  - Wanquan Liu
PY  - 2016/09
DA  - 2016/09
TI  - On the Second Descent Points for the K-Error Linear Complexity of 2n-Periodic Binary Sequences
BT  - Proceedings of the 2016 International Conference on Communications, Information Management and Network Security
PB  - Atlantis Press
SP  - 311
EP  - 314
SN  - 2352-538X
UR  - https://doi.org/10.2991/cimns-16.2016.77
DO  - 10.2991/cimns-16.2016.77
ID  - Zhou2016/09
ER  -