Investigations on Periodic Sequences With Maximum Nonlinear Complexity
Zhimin Sun, Xiangyong Zeng, Chunlei Li, Tor Helleseth · IEEE Transactions on Information Theory · 2017
The nonlinear complexity of a periodic sequence s is the length of the shortest feedback shift register that can generate s, and its value is upper bounded by the least period of s minus 1. In this paper, a recursive approach that generates all periodic sequences with maximum nonlinear complexity is presented, and the total number of such sequences is determined. The randomness properties of these sequences are also examined.