New Constructions of Binary Sequences With Optimal Autocorrelation Value/Magnitude
From MaRDI portal
Publication:4975978
DOI10.1109/TIT.2009.2039159zbMath1366.94458MaRDI QIDQ4975978
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (18)
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 ⋮ SOME METHODS TO DESIGN INTERLEAVED SEQUENCES OVER ⋮ The linear complexity of a class of binary sequences with optimal autocorrelation ⋮ On the 2-adic complexity of cyclotomic binary sequences of order three ⋮ Correlation properties of interleaved Legendre sequences and Ding-Helleseth-Lam sequences ⋮ Partial direct product difference sets and almost quaternary sequences ⋮ On the 2-adic complexity of cyclotomic binary sequences with period \(p^2\) and \(2p^2\) ⋮ New quaternary sequences with optimal odd-periodic autocorrelation magnitude ⋮ On three conjectures of binary sequences with low odd-periodic autocorrelation ⋮ The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude ⋮ A general construction of binary interleaved sequences of period \(4{N}\) with optimal autocorrelation ⋮ A generalization of combinatorial designs and related codes ⋮ New optimal binary sequences with period \(4p\) via interleaving Ding-Helleseth-Lam sequences ⋮ 2-adic complexity of binary sequences with interleaved structure ⋮ New \(M\)-ary sequences with low autocorrelation from interleaved technique ⋮ Families of \(p\)-ary sequences with low correlation and large linear complexity
This page was built for publication: New Constructions of Binary Sequences With Optimal Autocorrelation Value/Magnitude
