@article{Yan2022, 
author = {Tongjiang Yan and Pazilaiti Ainiwaer and Lianbo Du},
title = {On the 1-error linear complexity of two-prime generator},
year = {2022},
journal = {AIMS Mathematics},
volume = {7},
number = {4},
pages = {5821-5829},
keywords = {linear complexity, generalized cyclotomic sequence, k-error linear complexity, discrete Fourier transform},
url = {https://www.sciopen.com/article/10.3934/math.2022322},
doi = {10.3934/math.2022322},
abstract = {Jing et al. dealed with all possible Whiteman generalized cyclotomic binary sequences    s  (  a  ,  b  ,  c  ) with period    N  =  p  q, where    (  a  ,  b  ,  c  )  ∈  {  0  ,  1      }    3   and    p  ,  q are distinct odd primes (Jing et al. arXiv:2105.10947v1, 2021). They have determined the autocorrelation distribution and the 2-adic complexity of these sequences in a unified way by using group ring language and a version of quadratic Gauss sums. In this paper, we determine the linear complexity and the 1-error linear complexity of    s  (  a  ,  b  ,  c  ) in details by using the discrete Fourier transform (DFT). The results indicate that the linear complexity of    s  (  a  ,  b  ,  c  ) is large enough and stable in most cases.}
}