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 (2/sup n/-1)/sup 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 (2/sup n/-1)/sup k/ with n being a prime.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
