Channel coding with the (255,255-2T) Reed-Solomon codes over CF(256)
Helen Simons, H.F.A. Roefs · NASA STI/Recon Technical Report N · 1983
The class of (255, 255-2T) Reed-Solomon codes over CF(256) is studied in detail. In particular the encoding and decoding algorithms are elaborated. Main computational elements are the discrete Fourier transform for syndrome and error locator computation, Euclid's algorithm for solving the key equation and Horner's scheme for determining the error values. Special attention is given to the computational complexity, in particular the number of multiplications and additions required as a function of T. Finally some simulations are presented to demonstrate the quality of the obtained algorithms.