Linear complexity of a new generalized cyclotomic sequence of order four and length pq

Author(s):  
Shengqiang Li ◽  
Liang Zhou
2019 ◽  
Vol 30 (05) ◽  
pp. 759-779
Author(s):  
Priti Kumari ◽  
Pramod Kumar Kewat

Although for more than 20 years, Whiteman’s generalized cyclotomic sequences have been thought of as the most important pseudo-random sequences, but, there are only a few papers in which their 2-adic complexities have been discussed. In this paper, we construct a class of binary sequences of order four with odd length (product of two distinct odd primes) from Whiteman’s generalized cyclotomic classes. After that, we determine both 2-adic complexity and linear complexity of these sequences. Our results show that these complexities are greater than half of the period of the sequences, therefore, it may be good pseudo-random sequences.


2008 ◽  
Vol 178 (3) ◽  
pp. 807-815 ◽  
Author(s):  
Tongjiang Yan ◽  
Li Hong ◽  
Guozhen Xiao

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Pinhui Ke ◽  
Yan Zhong ◽  
Shengyuan Zhang

Sequences with high linear complexity property are of importance in applications. In this paper, based on the theory of generalized cyclotomy, new classes of quaternary generalized cyclotomic sequences with order 4 and period 2pm are constructed. In addition, we determine their linear complexities over finite field F4 and over ℤ4, respectively.


Sign in / Sign up

Export Citation Format

Share Document