{'fraction_non_alphanumeric': 0.011467889908256881, 'fraction_numerical': 0.0045871559633027525, 'mean_word_length': 5.242857142857143, '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}}
Constructing Periodic Binary Sequences With Maximum Nonlinear Span

The nonlinear span of a sequence x is defined as the length of the shortest feedback shift register that generates x. In this correspondence, we solve the problem of designing periodic binary sequences with given linear complexity and maximal possible nonlinear span. We concentrate on the case of sequences with period N=2n-1 and we introduce two construction methods