Characterization of the third descent points for the k-error linear complexity of 2n-periodic binary sequences
In this paper, a structural 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 third descent point (critical point) dist...
| Main Authors: | , , |
|---|---|
| Format: | Book Chapter |
| Published: |
2016
|
| Online Access: | http://hdl.handle.net/20.500.11937/45017 |
| Summary: | In this paper, a structural 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 third descent point (critical point) distribution of the k-error linear complexity for 2n- periodic binary sequences is characterized. As a consequence, we derive the complete counting functions on the 5-error linear complexity of 2n- periodic binary sequences when it is the third descent point. With the structural approach proposed here, one can further characterize other third and fourth descent points of the k-error linear complexity for 2n- periodic binary sequences. |
|---|