On the Linear Complexity of Generalized Cyclotomic Binary Sequences with Length 2p²

Abstract

In this paper, we compare two generalized cyclotomic binary sequences with length 2p² in terms of the linear complexity. One classical sequence is defined using the method introduced by Ding and Helleseth, while the other modified sequence is defined in a slightly different manner. We show that the modified sequence has linear complexity of 2p², which is higher than that of the classical one.