{'fraction_non_alphanumeric': 0.007792207792207792, 'fraction_numerical': 0.0025974025974025974, 'mean_word_length': 4.848484848484849, '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}}
The complexity of hard-decision decoding of linear codes

We study a general method of minimum distance decoding of linear codes that instead of decoding the original code recovers the transmitted codeword by a number of decodings of shortened codes. We present an implementation of this method whose complexity for long linear codes has the smallest known value for any code rate R, 0