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

TL;DR

This paper presents a straightforward method to determine the 2-adic complexity of periodic binary sequences with ideal two-level autocorrelation, simplifying previous approaches and confirming earlier main results.

Contribution

It introduces a simple approach to compute 2-adic complexity for specific binary sequences, improving upon prior complex methods.

Findings

Simplified computation method for 2-adic complexity

Validated previous main results with new approach

Applicable to sequences with ideal two-level autocorrelation

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.