{'fraction_non_alphanumeric': 0.033846153846153845, 'fraction_numerical': 0.008205128205128205, 'mean_word_length': 4.641618497109826, '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}}
List decoding of Error-Correcting Codes

Recently, Wu proposed in [24] a new approach to list decoding Reed-Solomon codes,
 quite dierent from the Guruswami-Sudan algorithm and its derivatives [1,2,10,18].
 It promises lower running-time and has shown new perspectives of the codes. Sadly,
 the impact of this idea has hitherto been minimal; the contribution is indisputable,
 so the reason might be found in the idea's sole exposition: a convoluted article,
 presenting and proving a long range of intricate results on a strict page limit.
 In this thesis, we give a complete, self-contained and novel presentation of Wu's
 decoding algorithm. The key mechanics of the algorithm build on a combination
 of several previous decoders, and we begin with a full presentation of these and
 their background theory. We then derive Wu's algorithm itself, with a clear division
 between the results in general algebraic theory, and the application of these on the
 decoding problem.