The Linear Complexity of Whiteman's Generalized Cyclotomic Sequences of Period $p^{m+1}q^{n+1}$

In this paper, we mainly get three results. First, let p, q be distinct primes with ((p-1)p,(q-1)q)=(p-1,q-1)=e ; we give a method to compute the linear complexity of Whiteman's generalized cyclotomic sequences of period p<sup>m+1</sup>q<sup>n+1</sup>. Second, if e=4, we compute the exact linear complexity of Whiteman's generalized cyclotomic sequences. Third, if p≡q 5 (mod 8), gcd(p-1, q-1)=4, and we fix a common primitive root g of both p and q, then 2∈H<sub>0</sub>=(g), which is a subgroup of the multiplicative group Z*<sub>pq</sub>, if and only if Whiteman's generalized cyclotomic numbers of order 4 depend on the decomposition pq=a<sup>2</sup>+4b<sup>2</sup> with 4|b.

[1]  Cunsheng Ding,et al.  Autocorrelation Values of Generalized Cyclotomic Sequences of Order Two , 1998, IEEE Trans. Inf. Theory.

[2]  T. Helleseth,et al.  New Generalized Cyclotomy and Its Applications , 1998 .

[3]  T. Helleseth,et al.  Generalized Cyclotomic Codes of Length , 1999 .

[4]  Cunsheng Ding,et al.  Linear Complexity of Generalized Cyclotomic Binary Sequences of Order 2 , 1997 .

[5]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.

[6]  Rudolf Lide,et al.  Finite fields , 1983 .

[7]  Michael Rosen,et al.  A classical introduction to modern number theory , 1982, Graduate texts in mathematics.

[8]  T. Helleseth,et al.  Generalized cyclotomic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/ , 1999 .

[9]  Cunsheng Ding,et al.  Several classes of binary sequences with three-level autocorrelation , 1999, IEEE Trans. Inf. Theory.

[10]  Xiaotong Fu,et al.  On the Linear Complexity of Generalized Cyclotomic Sequences of Order Four Over Zpq , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[11]  Enjian Bai,et al.  Some Notes on Prime-Square Sequences , 2007, Journal of Computer Science and Technology.

[12]  Fang Liu,et al.  A new frequency-hopping sequence set based upon generalized cyclotomy , 2013, Des. Codes Cryptogr..

[13]  Vladimir Edemskiy,et al.  About computation of the linear complexity of generalized cyclotomic sequences with period pn+1 , 2011, Proceedings of the Fifth International Workshop on Signal Design and Its Applications in Communications.

[14]  Edward Spence,et al.  A Family of Difference Sets , 1977, J. Comb. Theory, Ser. A.

[15]  Guozhen Xiao,et al.  Autocorrelation and Linear Complexity of the New Generalized Cyclotomic Sequences , 2007, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[16]  Guang Gong,et al.  Public-key cryptosystems based on cubic finite field extensions , 1999, IEEE Trans. Inf. Theory.

[17]  V. A. Edemskii On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes , 2010 .