3-adic complexity of ternary generalized cyclotomic sequences with period

Abstract

Abstract In this paper, we study the ternary generalized cyclotomic sequences with a period equal to a power of an odd prime. Ding-Helleseth’s generalized cyclotomic classes of order three are used for the definition of these sequences. We derive the symmetric 3-adic complexity of above mention sequences and obtain the estimate of symmetric 3-adic complexity of sequences. It is shown that 3-adic complexity of these sequences is large enough to resist the attack of the rational approximation algorithm for feedback with carry shift registers.