English

A lower bound on the 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period $p^n$

Information Theory 2017-04-26 v2 math.IT

Abstract

Let pp be an odd prime, nn a positive integer and gg a primitive root of pnp^n. Suppose Di(pn)={g2s+is=0,1,2,,(p1)pn12}D_i^{(p^n)}=\{g^{2s+i}|s=0,1,2,\cdots,\frac{(p-1)p^{n-1}}{2}\}, i=0,1i=0,1, is the generalized cyclotomic classes with Zpn=D0D1Z_{p^n}^{\ast}=D_0\cup D_1. In this paper, we prove that Gauss periods based on D0D_0 and D1D_1 are both equal to 0 for n2n\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 pnp^n. The result shows that the 2-adic complexity is at least pnpn11p^n-p^{n-1}-1, which is larger than N+12\frac{N+1}{2}, where N=pnN=p^n is the period of the sequence.

Keywords

Cite

@article{arxiv.1704.05544,
  title  = {A lower bound on the 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period $p^n$},
  author = {Yuhua Sun and Qiang Wang and Tongjiang Yan and Chun'e Zhao},
  journal= {arXiv preprint arXiv:1704.05544},
  year   = {2017}
}

Comments

11