The Algorithm of High-Radix Transforms for Reed Solomon Codes Over Fermat Primes
Hong Nie · Wuhan University Journal · 2000
Presents a new algorithm on transform decoding of Reed Solomon code, based on transform of Number Theory. It is show that a high radix FFT with generator γ =3 over GF( F n ) can be used for decoding of long RS codes of length 2 2 n . Such an RS decoder is considerably faster than a decoder using the usual radix 2 FFT. This technique applies most ideally to RS(255,223) code being considered currently for space and satellite communication applications.