An extension of binary cyclotomic sequences having order 2lt
Debashis Ghosh · Discrete Mathematics Algorithms and Applications · 2022
Several reasonably cyclotomic sequences are constructed by cyclotomic classes having good pseudo-randomness property. In this paper, we derive the linear complexity of an extended binary cyclotomic sequences of order [Formula: see text] over finite field having period [Formula: see text]. Our result shows that these sequences have higher linear complexity, which can resist linear attack.