中文

周期为$p^n$的Ding-Helleseth广义分圆序列的2-adic复杂度下界

信息论 2017-04-26 v2 math.IT

摘要

pp为奇素数,nn为正整数,ggpnp^n的原根。假设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, 是广义分圆类,且Zpn=D0D1Z_{p^n}^{\ast}=D_0\cup D_1。本文证明了基于D0D_0D1D_1的高斯周期在n2n\geq2时均等于0。作为应用,我们确定了一类周期为pnp^n的Ding-Helleseth广义分圆序列的2-adic复杂度的下界。结果表明,2-adic复杂度至少为pnpn11p^n-p^{n-1}-1,大于N+12\frac{N+1}{2},其中N=pnN=p^n为序列周期。

关键词

引用

@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}
}

备注

11