Abstract
A concept named 'incomplete locator polynomial' is introduced as a replacement for the traditional approach. Theorems for finding the incomplete locators were established when the Welch-Berlekamp algorithm (1986) was employed for decoding Reed-Solomon codes, and an incomplete iteration strategy of decoding Reed-Solomon codes, based on finding incomplete locator polynomials is presented, by which the redundant iterations in the Welch-Berlekamp algorithm are reduced significantly.
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.
