{'fraction_non_alphanumeric': 0.025974025974025976, 'fraction_numerical': 0.0, 'mean_word_length': 4.820754716981132, '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}}
Exploiting the CRC-CCITT code on the binary erasure channel

Cyclic redundancy check (CRC) codes are designed for error detection, but can in principle be used for error correction. In this work, we analyze the performance of the CRC-CCITT code, both as a stand-alone code, and as the outer code in a serially concatenated code with an inner low-density parity-check code on the binary erasure channel. To optimize the recovery failure probability for low channel erasure probabilities, we propose to add a permutation/interleaver between the outer and inner codes in order to increase the overall stopping distance.