Abstract
The problem of finding the length of a shortest feedback shift register that generates a given finite-length sequence is considered. An efficient algorithm for the determination of the span is proposed, that takes advantage of the special block structure of the associated system of linear equations. The span distribution of finite-length binary sequences is also studied.
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
