{'fraction_non_alphanumeric': 0.019189765458422176, 'fraction_numerical': 0.0, 'mean_word_length': 4.796296296296297, '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}}
Efficient Coding/decoding Strategies for Channels With Memory

Many digital communication channels are affected by errors that tend to occur in bursts. This paper proposes two new schemes for burst error correction. Both schemes employ a combination of two codes. In the first scheme, one of the codes is used for random error correction and for burst detection while the other one is used only for burst recovery. In the second scheme, one of the codes is used for burst detection and for channel state estimation. With the second scheme, both codes are used for error correction. Unlike existing burst-error-correcting schemes, it is shown that the proposed schemes are adaptive to channel conditions and less sensitive to errors in the guard space. For the same delay, the proposed schemes offer better performance than the interleaving schemes. When the channel is heavily corrupted by bursts, the improvement is even more pronounced.