New families of binary sequences with optimal three-level autocorrelation
From MaRDI portal
Publication:4544491
DOI10.1109/18.904555zbMath1019.94009OpenAlexW2102853310MaRDI QIDQ4544491
Cunsheng Ding, Tor Helleseth, Halvard Martinsen
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bdb78dd47be859643000f21c48ec981c61f47495
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)
Related Items (31)
The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length \(8q\) ⋮ Optimal and efficient designs for fMRI experiments via two-level circulant almost orthogonal arrays ⋮ A note on almost difference sets in nonabelian groups ⋮ Almost difference sets in nonabelian groups ⋮ The linear complexity of binary sequences of length \(2p\) with optimal three-level autocorrelation ⋮ Introduction to the special issue dedicated to Cunsheng Ding on the occasion of his 60th birthday ⋮ Estimate of 4-adic complexity of unified quaternary sequences of length \(2p \) ⋮ On the 2-adic complexity of cyclotomic binary sequences of order three ⋮ New classes of asymptotically optimal spectrally-constrained sequences derived from cyclotomy ⋮ 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\) ⋮ Optimal difference systems of sets and partition-type cyclic difference packings ⋮ Legendre G‐array pairs and the theoretical unification of several G‐array families ⋮ New quaternary sequences with optimal odd-periodic autocorrelation magnitude ⋮ Linear complexity of cyclotomic sequences of order six and BCH codes over \(\mathrm{GF}(3)\) ⋮ Some new balanced and almost balanced quaternary sequences with low autocorrelation ⋮ The linear complexity of a class of binary sequences with period \(2p\) ⋮ A generalization of combinatorial designs and related codes ⋮ New optimal binary sequences with period \(4p\) via interleaving Ding-Helleseth-Lam sequences ⋮ Constructions of almost difference sets from finite fields ⋮ Two new classes of binary sequence pairs with three-level cross-correlation ⋮ New \(M\)-ary sequences with low autocorrelation from interleaved technique ⋮ Algebraic manipulation detection codes via highly nonlinear functions ⋮ Partial Geometric Difference Families ⋮ Codebooks from almost difference sets ⋮ The linear complexity of generalized cyclotomic sequences with period \(2p^n\) ⋮ Binary sequences with optimal autocorrelation ⋮ Highly nonlinear mappings ⋮ Almost designs and their links with balanced incomplete block designs ⋮ Unnamed Item ⋮ On the equivalence of several classes of quaternary sequences with optimal autocorrelation and length \(2p\)
This page was built for publication: New families of binary sequences with optimal three-level autocorrelation
