2013/10/01 by Jianqin Zhou, Jun Liu, Zhou, Jianqin +3
Computer Science · Engineering · #Coding theory and cryptography #graph theory and CDMA systems #Cellular Automata and Applications
paper · pdf · doi:10.48550/arxiv.1310.0132
By using the sieve method of combinatorics, we study k-error linear complexity distribution of 2n-periodic binary sequences based on Games-Chan algorithm. For k=4,5, the complete counting functions on the k-error linear complexity of 2n-periodic balanced binary sequences (with linear complexity less than 2n) are presented. As a consequence of the result, the complete counting functions on the 4-error linear complexity of 2n-periodic binary sequences (with linear complexity 2n or less than 2n) are obvious. Generally, the complete counting functions on the k-error linear complexity of 2n-periodic binary sequences can be obtained with a similar approach.