On the 2-Adic Complexity of the Ding-Helleseth-Martinsen Binary Sequences

2019/04/11 by Lulu Zhang, Jun Zhang, Zhang, Lulu +5
Computer Science · Engineering · #Cellular Automata and Applications #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1904.05499

openalex publication_date 2019/04/11 · openalex created_date 2019/04/25 · openalex updated_date 2026/07/28

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 \mathbbF_q and valued in ℤ_2^N-1 where q ≡ 5\pmod 8 is a prime number and N=2q is the period of the DHM sequences.

Related

• A New Method to Compute the 2-adic Complexity of Binary Sequences
• On the 2-adic complexity of a class of binary sequences of period 4p with optimal autocorrelation magnitude
• Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of period of twin prime products
• A lower bound on the 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period pⁿ
• The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude