Abstract
A method is presented for decoding erasures and errors in Reed-Solomon (RS) codes over GF <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(q)</tex> . It uses fewer operations when the code is of medium or low rate, when the number of erasures is relatively large, and when <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">q-1</tex> is prime. This method can be used in conjunction with the customary method of decoding RS codes and can decrease the maximum number of operations needed to decode certain codes. This procedure is also applicable to generalized RS codes of length <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">q</tex> over GF <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(q)</tex> .
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 call
