Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 18 Apr 2017 in cs.IT and math.IT | (1704.05544v2)

Abstract: Let pp be an odd prime, nn a positive integer and gg a primitive root of p<sup>np<sup>n. Suppose Di<sup>(p<sup>n)=g<sup>2s+i∣s=0,1,2,⋯ ,(p−1)p<sup>n−12D_i<sup>{(p<sup>n)}={g<sup>{2s+i}|s=0,1,2,\cdots,\frac{(p-1)p<sup>{n-1}}{2}}, i=0,1i=0,1, is the generalized cyclotomic classes with Zp<sup>n<sup>∗=D0∪</sup></sup>D1Z_{p<sup>n}<sup>{\ast}=D_0\cup</sup></sup> D_1. In this paper, we prove that Gauss periods based on D0D_0 and D1D_1 are both equal to 0 for n≥2n\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 p<sup>np<sup>n. The result shows that the 2-adic complexity is at least p<sup>n−p<sup>n−1−1p<sup>n-p<sup>{n-1}-1, which is larger than N+12\frac{N+1}{2}, where N=p<sup>nN=p<sup>n is the period of the sequence.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.