{'fraction_non_alphanumeric': 0.02857142857142857, 'fraction_numerical': 0.0, 'mean_word_length': 5.258928571428571, '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 fast decoding algorithm for Reed-Solomon codes with enhanced burst correcting capability

Based on the properties of cyclic codes, a new decoding algorithm for burst-error-correction is proposed in this paper. This algorithm can effectively correct burst errors with length that approaches to n-k for (n,k) Reed-Solomon (RS) codes. Moreover, due to the use of error locations correlation within a burst, divisions are exempted from the decoding process, achieving a fast decoding algorithm with much less computational complexity compared with existing algorithms. It is shown that the proposed algorithm can be widely used in wireless communications, wireless digital broadcast systems, and so on.