A new decoding algorithm for Reed-Solomon Code
Tze-Hwa Liu · University of Southern California Digital Library · 2015
Much work has been done to find an efficient way to decode the Reed-Solomon Code. In this thesis, we present a new algorithm which can bypass the syndrome computation and process the remainder polynomial directly. A new key equation is derived and solved. The new algorithm is illustrated by examples. The order of complexity is compared with other well-known algorithms. And finally a generalized check positions decoding scheme is presented. (Copies available exclusively from Micrographics Department, Doheny Library, USC, Los Angeles, CA 90089.)