Concepedia

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

Honggang Hu

IEEE Transactions on Information Theory · 2014 · 53 citations · 4 references

DOI

Concepts

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.

References

4

Feedback shift registers, 2-adic span, and combiners with memory

Andrew Klapper, Mark Goresky · Journal of Cryptology · 1997 · 272 citations · Full text

, , +14

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

Hai Xiong, Longjiang Qu, Chao Li · IEEE Transactions on Information Theory · 2014 · 55 citations

, , +9

$2$-Adic Complexity of Binary $m$-Sequences

Tian Tian, Wen‐Feng Qi · IEEE Transactions on Information Theory · 2010 · 40 citations

, , +8

On the $2$-Adic Complexity and the $k$-Error $2$-Adic Complexity of Periodic Binary Sequences

Honggang Hu, Dengguo Feng · IEEE Transactions on Information Theory · 2008 · 31 citations

, , +9