Abstract
Along with a brief review, the generalised design philosophy of forward error correcting codecs using systematic primitive Reed-Solomon (R-S) codes over GF(2m) has been discussed. For decoding die R-S codes, the Berlekamp-Massey algorithm, the Chien search procedure and Forney's method of finding error magnitudes have been adopted. Software implementation of several Reed-Solomon codecs over GF(25), GF(26) and GF(27) and their performances in presence of random errors have been reported in this paper. The purpose of this paper is to help the designer to gain an insight into the complexities involved in the design and implementation of the R-S codes and to explore their features for required applications.
Sign-in/Register to access full text options 
Free) 
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
