Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 58 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 12 tok/s Pro
GPT-5 High 17 tok/s Pro
GPT-4o 95 tok/s Pro
Kimi K2 179 tok/s Pro
GPT OSS 120B 463 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
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.

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

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