Balanced Whiteman Generalized Cyclotomic Sequences with Maximal 2-adic Complexity

摘要

Binary sequences with high linear complexity and high2-adic complexity have important applications in communication and cryptography.In this paper, the 2-adic complexity of a class of balanced Whitemangeneralized cyclotomic sequences which have high linear complexityis considered. Through calculating the determinant of the circulant matrixconstructed by one of these sequences, the result shows that the 2-adiccomplexity of this class of sequences is large enough to resist the attack ofthe rational approximation algorithm (RAA) for feedback with carry shiftregisters (FCSRs).