Abstract
A decoding method is proposed for the redundant residue polynomial codes, a class that includes Reed-Solomon codes. The method is based on properties of Euclid's algorithm. The advantage of the method is that the computation of both the error-locator polynomial and the error-evaluator polynomial needed in conventional decoding methods can be avoided. The method is suitable for decoding concatenated codes whose outer codes are redundant residue polynomial codes, since they are easily decoded by ignoring erasures detected in the inner codes. >
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.
