Abstract
Known properties of cyclic codes are used to give a unified description of many classical decoding algorithms for Reed-Solomon codes up to half the minimum distance. This description allows also simplified proofs for these decoders. Further, a novel decoding algorithm is derived using these properties directly and variants of a new error/erasure decoding algorithm are given. For decoding beyond half the minimum distance, a basis of all solutions for decoding is derived. This basis allows to use side information in order to decode beyond half the minimum distance. Other methods where this basis can be used are power decoding, also known as virtual syndrome extension, where additional equations are generated by taking powers of the received symbols, and interleaved Reed-Solomon codes. The extended Euclidean algorithm, which calculates the greatest common divisor, plays an essential role in many presented methods.
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.
