{'fraction_non_alphanumeric': 0.0026041666666666665, 'fraction_numerical': 0.0, 'mean_word_length': 5.015625, '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}}
Two-stage trellis decoding of RS codes based on the Shannon product

In this paper we present a tech nique for low complexity decoding of Reed Solomon RS codes We describe a method for which the implementation complexity has been estimated when compared to standard Viterbi decoding over the minimal trellis Finally we present some computer simulation results for decoding the RS code