Abstract
The construction of a shortest feedback shift register which generates a given finite sequence is described for the cases of linear and nonlinear feedback logic. It is shown that the ratio of the number of delay elements required in the linear case to that of the nonlinear case grows without bound for proper choice of sequences.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.