Comments on “A New Method to Compute the 2-Adic Complexity of Binary Sequences”
From MaRDI portal
Publication:2986191
DOI10.1109/TIT.2014.2336843zbMath1360.94277arXiv1406.3889OpenAlexW2962964631MaRDI QIDQ2986191
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
Related Items (14)
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\) ⋮ 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 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\) ⋮ The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation ⋮ The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude ⋮ 2-Adic Complexity of Two Classes of Generalized Cyclotomic Binary Sequences ⋮ 2-adic complexity of binary sequences with interleaved structure ⋮ 2-Adic and Linear Complexities of a Class of Whiteman’s Generalized Cyclotomic Sequences of Order Four ⋮ 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
This page was built for publication: Comments on “A New Method to Compute the 2-Adic Complexity of Binary Sequences”
