2000 character limit reached
A lower bound on the 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period $p^n$ (1704.05544v2)
Published 18 Apr 2017 in cs.IT and math.IT
Abstract: Let $p$ be an odd prime, $n$ a positive integer and $g$ a primitive root of $pn$. Suppose $D_i{(pn)}={g{2s+i}|s=0,1,2,\cdots,\frac{(p-1)p{n-1}}{2}}$, $i=0,1$, is the generalized cyclotomic classes with $Z_{pn}{\ast}=D_0\cup D_1$. In this paper, we prove that Gauss periods based on $D_0$ and $D_1$ are both equal to 0 for $n\geq2$. As an application, we determine a lower bound on the 2-adic complexity of a class of Ding-Helleseth generalized cyclotomic sequences of period $pn$. The result shows that the 2-adic complexity is at least $pn-p{n-1}-1$, which is larger than $\frac{N+1}{2}$, where $N=pn$ is the period of the sequence.