Abstract
<abstract><p>Jing et al. dealed with all possible Whiteman generalized cyclotomic binary sequences $ s(a, b, c) $ with period $ N = pq $, where $ (a, b, c) \in \{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.</p></abstract>
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.