Abstract
Gao's algorithm for decoding Reed-Solomon codes is considered here. This algorithm is a new algorithm that computes the message polynomial estimate directly without explicitly finding error locations or error magnitudes. A generalized-minimum-distance (GMD) decoding procedure is used in conjunction with Gao's algorithm for efficiently decoding Reed-Solomon codes. It is shown here that the decoder polynomial only has to be slightly modified as the number of erasures is increased for each step of the generalized-minimum-distance decoding.
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.
