2000 character limit reached
On the 2-Adic Complexity of the Ding-Helleseth-Martinsen Binary Sequences
Published 11 Apr 2019 in cs.IT and math.IT | (1904.05499v1)
Abstract: We determine the 2-adic complexity of the Ding-Helleseth-Martinsen (DHM) binary sequences by using cyclotomic numbers of order four, "Gauss periods" and "quadratic Gauss sum" on finite field $\mathbb{F}q$ and valued in $\mathbb{Z}{2N-1}$ where $q \equiv 5\pmod 8$ is a prime number and $N=2q$ is the period of the DHM sequences.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.