{'fraction_non_alphanumeric': 0.028328611898016998, 'fraction_numerical': 0.0169971671388102, 'mean_word_length': 4.619047619047619, '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}}
New results on binary linear codes

This research announcement describes in very rough terms methods and a computer language under development, which can be used to prove the nonexistence of binary linear codes. Over a hundred new results have been obtained by the author. For example, there is no [29,11,10] code. The proof of this is roughly outlined.