supported by the National Natural Science Foundation of China(No.61170319,No.61072140,No.61373171);the 111 Project(No.B08038);the Specialized Research Fund for the Doctoral Program of Higher Education(No.20100203110003);the Fujian Provincial Key Laboratory of Network Security and Cryptology Research Fund(Fujian Normal University)(No.15002);the Shandong Provincial Natural Science Foundation of China(No.ZR2014FQ005);the Fundamental Research Funds for the Central Universities(No.15CX08011A,No.15CX02065A,No.15CX02060A,No.15CX05060A,No.16CX02013A);the Applied Basic Research Program of Qingdao(No.16-5-1-5-jch)
Binary sequences with large linear complexity have been found many applications in communication systems.We determine the linear complexity of a family of p^2-periodic binary sequences derived from polynomial quotient...
Supported by the National Natural Science Foundation of China (61170319,61063041);the Natural Science Fund of Shandong Province (ZR2010FM017);the China Postdoctoral Science Foundation Funded Project(119103S148);the Fundamental Research Funds for the Central Universities(11CX04056A,10CX04038A)
This paper contributes to the stability of linear complexity of a binary periodic Jacobi sequence.By employing a pair of reference sequences,we prove that the linear complexity of a binary Jacobi sequence is unstable,...