Trace representation of the binary pq2-periodic sequences derived from Euler quotients

2021 ◽  
Vol 13 (2) ◽  
pp. 343-359
Author(s):  
Jingwei Zhang ◽  
Chuangqiang Hu ◽  
Xiang Fan ◽  
Chang-An Zhao
Author(s):  
Minglong QI ◽  
Shengwu XIONG ◽  
Jingling YUAN ◽  
Wenbi RAO ◽  
Luo ZHONG
Keyword(s):  

1958 ◽  
Vol 2 (2) ◽  
pp. 285-302 ◽  
Author(s):  
N. J. Fine
Keyword(s):  

Author(s):  
Longfei Liu ◽  
Xiaoyuan Yang ◽  
Bin Wei ◽  
Liqiang Wu

Periodic sequences over finite fields, constructed by classical cyclotomic classes and generalized cyclotomic classes, have good pseudo-random properties. The linear complexity of a period sequence plays a fundamental role in the randomness of sequences. In this paper, we construct a new family of quaternary generalized cyclotomic sequences with order [Formula: see text] and length [Formula: see text], which generalize the sequences constructed by Ke et al. in 2012. In addition, we determine its linear complexity using cyclotomic theory. The conclusions reveal that these sequences have high linear complexity, which means they can resist linear attacks.


Sign in / Sign up

Export Citation Format

Share Document