{'fraction_non_alphanumeric': 0.019230769230769232, 'fraction_numerical': 0.0, 'mean_word_length': 5.415384615384616, '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}}
A Transform-Domain Decoding Algorithm for Reed-Solomon Codes

This paper presents a Reed-Solomon decoding algorithm based on the Euclidean algorithm. The algorithm is conceptually simple and operates only in transform domain. The spectrum of the codeword is directly computed without the explicit knowledge of error-locator and error-evaluator polynomials; the Chien search and the Forney algorithm are not necessary