{'fraction_non_alphanumeric': 0.03541076487252125, 'fraction_numerical': 0.0056657223796034, 'mean_word_length': 4.611111111111111, '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}}
Generation of canonical M-sequences and dual bases

An expression for the shift necessary to obtain a canonical M-sequence is obtained in terms of the coefficients of the primitive polynomial that generates this m-sequence. This shift for obtaining a canonical M-sequence is also directly related to the shift for obtaining the location of the span "100...0" in the M-sequence. In addition, a recursion is developed for obtaining the dual basis elements of the basis expressing GF(q/sup m/) over GF(q). Canonical M-sequences and dual bases are important in the design of sequences for spread-spectrum multiple-access systems as well as in the design of general decoder structures using bit-serial encoders.