{'fraction_non_alphanumeric': 0.027434842249657063, 'fraction_numerical': 0.0, 'mean_word_length': 5.186440677966102, '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}}
Turbo-like soft-decision decoding of Reed-Solomon codes

We aim to bridge the gap between classical coding theory and soft decoding. Reed-Solomon (RS) codes are chosen as an example, and a few standard possibilities for a soft RS decoder are explored. Soon, it is noticed that the resulting (standard) algorithms are too complex and/or not very performant. However, by employing a special critically sampled filter bank representation for the RS codes, an algorithm is developed that shows a good tradeoff between computational complexity and soft decoding performance. Furthermore, it is demonstrated that this algorithm shows remarkable similarities with turbo codes, thereby preserving the perfectness of the original RS code.