{'fraction_non_alphanumeric': 0.030120481927710843, 'fraction_numerical': 0.028112449799196786, 'mean_word_length': 5.565789473684211, '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}}
An efficient scheme to determine the weight distribution of binary (138, 69, 22) extended quadratic residue code

This paper utilizes an efficient scheme which consists of a weight-counting algorithm, the combinatorial designs of the Assmus-Mattson theorem, and the weight polynomial of Gleasonpsilas theorem to determine the weight distributions of binary extended quadratic residue codes. As a consequence, the weight distribution of binary (138, 69, 22) extended quadratic residue code is given.