Abstract
An analysis of the Berlekamp-Massey Linear Feedback Shift-Register (LFSR) Synthesis Algorithm is provided which shows that an input string of length n requires O(n2) multiplication/addition operations in the underlying field of definition. We also derive the length distribution for digit strings of length n. Results show that, on the average, the encoded length is no greater than n + 1. Furthermore, we exhibit a connection between step 1 of the Ling-Palermo algorithm and the LFSR Algorithm, and the LFSR Algorithm turns out to be computationally superior.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
