Autocorrelation values of generalized cyclotomic sequences of order two
From MaRDI portal
Publication:4701151
DOI10.1109/18.681354zbMath0943.94006OpenAlexW2005235240MaRDI QIDQ4701151
Publication date: 21 November 1999
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/259fdd9e6facaf9adf0c366d5f9951a58636cb3e
correlation functionpatternscyclotomic classesperiodic binary sequencegeneralized cyclotomic numbersperiodic autocorrelation
Related Items (44)
Unnamed Item ⋮ 2-adic complexity of two constructions of binary sequences with period \(4N\) and optimal autocorrelation magnitude ⋮ Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\) ⋮ On the k-error linear complexity of binary sequences derived from polynomial quotients ⋮ Generalized cyclotomic numbers of order two and their applications ⋮ Sequences related to Legendre/Jacobi sequences ⋮ Gauss periods and codebooks from generalized cyclotomic sets of order four ⋮ A new frequency-hopping sequence set based upon generalized cyclotomy ⋮ Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length \(pq\) ⋮ Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\) ⋮ Remarks on the generalized cyclotomic sequences of length \(2p^m\) ⋮ Two Boolean Functions with Five-Valued Walsh Spectra and High Nonlinearity ⋮ New classes of asymptotically optimal spectrally-constrained sequences derived from cyclotomy ⋮ On the linear complexity and autocorrelation of generalized cyclotomic binary sequences with period \(4p^n \) ⋮ On the linear complexity of binary threshold sequences derived from Fermat quotients ⋮ Pseudo-randomness of certain sequences of \(k\) symbols with length \(pq\) ⋮ 2-Adic Complexity of Two Classes of Generalized Cyclotomic Binary Sequences ⋮ A note on binary sequence pairs with two-level correlation ⋮ Linear complexity of cyclotomic sequences of order six and BCH codes over \(\mathrm{GF}(3)\) ⋮ Construction of quaternary sequences of length \(pq\) with low autocorrelation ⋮ The linear complexity of new generalized cyclotomic binary sequences of order four ⋮ Constructions of almost difference families ⋮ New \((q,K,\lambda)\)-ADFs via cyclotomy ⋮ Linear complexity and trace representation of quaternary sequences over \(\mathbb {Z}_{4}\) based on generalized cyclotomic classes modulo \( pq\) ⋮ Constructions of almost difference sets from finite fields ⋮ Cryptographic properties of some binary generalized cyclotomic sequences with the length \(p^{2}\) ⋮ A note on cyclic almost difference families ⋮ Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\) ⋮ Constructions of \((q,K,\lambda, t,Q)\) almost difference families ⋮ On the linear complexity of Legendre-Sidelnikov sequences ⋮ Linear complexity problem of binary Jacobi sequence ⋮ Linear complexity of Ding generalized cyclotomic sequences ⋮ The existence of \((q,k,\lambda ,t)\)-ADFs for \(k=4,5,6\) ⋮ New \(M\)-ary sequences with low autocorrelation from interleaved technique ⋮ On the properties of generalized cyclotomic binary sequences of period \(2p^m\) ⋮ The existence of almost difference families ⋮ Autocorrelation and linear complexity of binary generalized cyclotomic sequences with period \(pq\) ⋮ Linear complexity of a class of pseudorandom sequences over a general finite field ⋮ Linear complexity of binary Whiteman generalized cyclotomic sequences of order \(2^k\) ⋮ Codebooks from almost difference sets ⋮ Remarks on a cyclotomic sequence ⋮ Linear complexity and correlation of a class of binary cyclotomic sequences ⋮ Binary sequences with optimal autocorrelation ⋮ Additive character sums of polynomial quotients
This page was built for publication: Autocorrelation values of generalized cyclotomic sequences of order two
