{'fraction_non_alphanumeric': 0.022172949002217297, 'fraction_numerical': 0.0, 'mean_word_length': 4.947368421052632, '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}}
On cyclic codes that are invariant under the general linear group

Using a polynomial approach to linear codes, one derives necessary and sufficient conditions for cyclic q -ary codes to be invariant under the general linear group of substitutions over an extension field of GF(q) . The important class of polynomial codes, introduced by Kasami, Lin, and Peterson, satisfy the conditions and several new results are obtained about some of these codes.