A class of balanced binary sequences with optimal autocorrelation properties
From MaRDI portal
Publication:4132110
DOI10.1109/TIT.1977.1055672zbMath0359.94018OpenAlexW2164334465MaRDI QIDQ4132110
Abraham Lempel, W. L. Eastman, Martin Cohn
Publication date: 1977
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1977.1055672
Related Items (35)
Optimal and efficient designs for fMRI experiments via two-level circulant almost orthogonal arrays ⋮ Feedback shift registers, 2-adic span, and combiners with memory ⋮ Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences ⋮ The linear complexity of a class of binary sequences with optimal autocorrelation ⋮ On the 2-adic complexity of cyclotomic binary sequences of order three ⋮ Autocorrelation of the Modified Binary Two-Prime Sidelnikov Sequence ⋮ Some new constructions of difference systems of sets ⋮ Correlation properties of interleaved Legendre sequences and Ding-Helleseth-Lam sequences ⋮ Status of three classes of sequences ⋮ On the pseudorandom properties of \(k\)-ary Sidel'nikov 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\) ⋮ Legendre G‐array pairs and the theoretical unification of several G‐array families ⋮ Sequences with small correlation ⋮ A new class of near-optimal partial Fourier codebooks from an almost difference set ⋮ Addendum to Sidel'nikov sequences over nonprime fields ⋮ 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\) ⋮ New \((q,K,\lambda)\)-ADFs via cyclotomy ⋮ Merit factors of polynomials derived from difference sets ⋮ New optimal binary sequences with period \(4p\) via interleaving Ding-Helleseth-Lam sequences ⋮ On the linear complexity of Sidel'nikov sequences over nonprime fields ⋮ A note on cyclic almost difference families ⋮ Constructions of \((q,K,\lambda, t,Q)\) almost difference families ⋮ Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences ⋮ The existence of \((q,k,\lambda ,t)\)-ADFs for \(k=4,5,6\) ⋮ The existence of almost difference families ⋮ Codebooks from almost difference sets ⋮ Several classes of \((2^{m}-1,w,2)\) optical orthogonal codes ⋮ Binary sequences with optimal autocorrelation ⋮ On the k-error Linear Complexity of Subsequences of d-ary Sidel’nikov Sequences Over Prime Field 𝔽d ⋮ 𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3 ⋮ On the density of some special primes ⋮ Highly nonlinear mappings
This page was built for publication: A class of balanced binary sequences with optimal autocorrelation properties
