Complete characterization of the first descent point distribution for the k-error linear complexity of 2n-periodic binary sequences
In this paper, a new constructive approach of determining the first descent point distribution for the k-error linear complexity of 2 n -periodic binary sequences is developed using the sieve method and Games-Chan algorithm. First, the linear complexity for the sum of two sequences with the same li...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
2017
|
| Online Access: | http://hdl.handle.net/20.500.11937/56588 |