{'fraction_non_alphanumeric': 0.020642201834862386, 'fraction_numerical': 0.0011467889908256881, 'mean_word_length': 5.147887323943662, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Decoding Reed-Solomon codes using the Guruswami-Sudan algorithm

List decoding algorithms improve the error-correction performance of a code by generating a list of possible transmitted messages instead of one unique message as with conventional algebraic decoders, making it possible to correct errors beyond half the hamming distance boundary d/2. In this paper, we present new simulation results for Reed-Solomon (RS) codes using the Guruswami-Sudan (GS) list decoding algorithm over the AWGN and Rayleigh fading channels. The results show significant coding gains over the unique decoding algorithm can be achieved for low rate codes and over fading channels. A complexity analysis of GS algorithm is presented and comparisons are made with the unique decoding algorithm. We conclude that although coding gains can be achieved, it is at the expense of high complexity.