Title :
The linear complexity of binary sequences with period (2n-1)k
Author :
Hua, Cheng ; Xiao, Guo-zhen
Author_Institution :
Dept. of Math., Northern Jiaotong Univ., Beijing, China
fDate :
5/1/1991 12:00:00 AM
Abstract :
In recent years, some new generators of binary sequences, such as the clock-controlled shift register and the cascade-connected clock-controlled shift register, have been suggested. Most sequences generated by these models have period of the form (2n-1)k. Further, many other kinds of binary sequences have this kind of period. Here, the authors give the lower bound of linear complexity of all these kinds of sequences that have period of the form (2n-1)k with n being a prime.
Keywords :
binary sequences; binary sequences; cascade connected shift register; clock-controlled shift register; linear complexity; lower bound; Binary sequences; Cities and towns; Clocks; Mathematics; Polynomials; Shift registers;
Journal_Title :
Information Theory, IEEE Transactions on