Abstract:
The Guruswami-Sudan (GS) decoding algorithm is a list-type decoding algorithm that corrects more errors than the “declared” capability, for certain coding rates of the Reed-Solomon (RS) codes. Using computer simulations, the paper presents a comparison between the correction capability and the processing time of the GS and Berlekamp-Massey (BM) algorithms. The simulations are employed to establish the optimum values of the GS parameters that ensure the maximum performance/processing time ratio. Some methods of changing the GS parameters, in terms of the packet-error length, which provide shorter decoding times, are also presented.
