Comments on “A New Method to Compute the 2-Adic Complexity of Binary Sequences”

DOI10.1109/TIT.2014.2336843MaRDI QIDQ2986191zbMATH OpenOpenAlexFDO

Authors Hong Gang Hu

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/1406.3889

Mathematics Subject Classification ID

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

Abstract: We show that there is a very simple approach to determine the 2-adic complexity of periodic binary sequences with ideal two-level autocorrelation. This is the first main result by H. Xiong, L. Qu, and C. Li, IEEE Transactions on Information Theory, vol. 60, no. 4, pp. 2399-2406, Apr. 2014, and the main result by T. Tian and W. Qi, IEEE Transactions on Information Theory, vol. 56, no. 1, pp. 450-454, Jan. 2010.

Cited in

(17)

• Symmetric 2-adic complexity of Tang-Gong interleaved sequences from generalized GMW sequence pair
• 2-adic complexity of two constructions of binary sequences with period \(4N\) and optimal autocorrelation magnitude
• 2-adic complexity of two classes of generalized cyclotomic binary sequences
• Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of periods of twin prime products
• The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude
• Linear complexity over \(\mathbb{F}_q\) and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation
• On the 4-adic complexity of the two-prime quaternary generator
• Symmetric 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period \(pq\)
• On the 2-adic complexity of cyclotomic binary sequences of order three
• On the symmetric 2-adic complexity of periodic binary sequences
• On "A new representation of elements of finite fields GF(2/sup m/) yielding small complexity arithmetic circuits"
• The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation
• 2-Adic and Linear Complexities of a Class of Whiteman’s Generalized Cyclotomic Sequences of Order Four
• The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude
• The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length \(8q\)
• On the 2-adic complexity of cyclotomic binary sequences with period \(p^2\) and \(2p^2\)
• 2-adic complexity of binary sequences with interleaved structure

This page was built for publication: Comments on “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 Q2986191)