A New Method to Compute the 2-Adic Complexity of Binary Sequences

DOI10.1109/TIT.2014.2304451MaRDI QIDQ2986462zbMATH OpenOpenAlexFDO

Authors Hai Xiong, Longjiang Qu, Chao Li

Publication date 16 May 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1309.1625

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Abstract: In this paper, a new method is presented to compute the 2-adic complexity of pseudo-random sequences. With this method, the 2-adic complexities of all the known sequences with ideal 2-level autocorrelation are uniformly determined. Results show that their 2-adic complexities equal their periods. In other words, their 2-adic complexities attain the maximum. Moreover, 2-adic complexities of two classes of optimal autocorrelation sequences with period $Nequiv1mod4$, namely Legendre sequences and Ding-Helleseth-Lam sequences, are investigated. Besides, this method also can be used to compute the linear complexity of binary sequences regarded as sequences over other finite fields.

Cited in

(24)

• The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation
• A lower bound on the 2-adic complexity of the modified Jacobi sequence
• 2-adic complexity of binary sequences with interleaved structure
• Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of periods of twin prime products
• Symmetric 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period \(pq\)
• On the 4-adic complexity of the two-prime quaternary generator
• 2-adic complexity of two constructions of binary sequences with period \(4N\) and optimal autocorrelation magnitude
• The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length 8q
• Linear complexity over \(\mathbb{F}_q\) and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation
• The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude
• Trace representation of Legendre sequences over non-binary fields
• On the joint 2-adic complexity of binary multisequences
• 2-adic complexity of two classes of generalized cyclotomic binary sequences
• scientific article; zbMATH DE number 953031 (Why is no real title available?)
• 2-Adic and Linear Complexities of a Class of Whiteman’s Generalized Cyclotomic Sequences of Order Four
• On the 2-Adic Complexity and the k-Error 2-Adic Complexity of Periodic Binary Sequences
• On the 2-adic complexity of cyclotomic binary sequences of order three
• On the 2-adic complexity of cyclotomic binary sequences with period \(p^2\) and \(2p^2\)
• On the symmetric 2-adic complexity of periodic binary sequences
• Symmetric 2-adic complexity of Tang-Gong interleaved sequences from generalized GMW sequence pair
• Linear complexity and 2-adic complexity of new cyclotomic binary sequences of order four with low autocorrelation
• The symmetric 2-adic complexity of Tang-Gong interleaved sequences from Legendre sequence pair
• On the 2-adic complexity of cyclotomic binary sequences of order four
• The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude

This page was built for publication: A New Method to Compute the 2-Adic Complexity of Binary Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986462)