2000 character limit reached
A lower bound on the 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period
Published 18 Apr 2017 in cs.IT and math.IT | (1704.05544v2)
Abstract: Let be an odd prime, a positive integer and a primitive root of . Suppose , , is the generalized cyclotomic classes with . In this paper, we prove that Gauss periods based on and are both equal to 0 for . As an application, we determine a lower bound on the 2-adic complexity of a class of Ding-Helleseth generalized cyclotomic sequences of period . The result shows that the 2-adic complexity is at least , which is larger than , where is the period of the sequence.
Paper Prompts
Sign up for free to create and run prompts on this paper.