Autocorrelation values of generalized cyclotomic sequences of order two
Let \(p\) and \(q\) be two distinct primes with \(\text{gcd} (p-1, q-1)= 2\). Define \(N=pq\) and \(e= (p-1)(q-1)/2\). Let \(g\) be a common primitive root of \(p\) and \(q\) and let \(x\) be defined by \(x\equiv g\pmod p\) and \(x\equiv 1\pmod q\). Define the cyclotomic classes \(D_0\) and \(D_1\) by \[ D_i= \{g^s x^i\mid s=0, 1,\dots, e-1\}, \quad i=0,1. \] The generalized cyclotomic numbers of order two are defined by \((i,j)= |(D_i+1)\cap D_j|\) for all \(i=0,1\), \(j=0,1\). The author defines a binary sequence of period \(N\), such that \(s_i=1\) if \(i\pmod N\in \{p, 2p,\dots, (q-1)p\}\cup D_1\) and \(s_i =0\) otherwise. The periodic autocorrelation of the periodic binary sequence \((s_i)\) of length \(N\) is defined to be \(C_s(w)= \frac 1N \sum_{i\in \mathbb{Z}_N} (-1)^{s_{i+w}+s_i}\) where \(0\leq w\leq N-1\). The correlation function of this sequence is determined from the properties of the generalized cyclotomic numbers of order two. Further, the distribution of patterns of length two in the sequence is studied.
- Generalized cyclotomic sequences of order four over \(\mathbb Z_{pq}\) and their autocorrelation values
- Autocorrelation values of Whiteman generalized cyclotomic sequences
- Autocorrelation values of new generalized cyclotomic sequences of order six over \(\mathbb Z_{pq}\)
- Autocorrelation and linear complexity of binary generalized cyclotomic sequences with period \(pq\)
- Autocorrelation values and linear complexity of new generalized cyclotomic sequences
- Linear complexity of binary Whiteman generalized cyclotomic sequences of order 2ᵏ
- Codebooks from almost difference sets
- Remarks on a cyclotomic sequence
- Binary sequences with optimal autocorrelation
- Linear complexity of a class of pseudorandom sequences over a general finite field
- Remarks on the generalized cyclotomic sequences of length 2p^m
- On the linear complexity of binary threshold sequences derived from Fermat quotients
- On the properties of generalized cyclotomic binary sequences of period \(2p^m\)
- Autocorrelation and linear complexity of binary generalized cyclotomic sequences with period \(pq\)
- 2-adic complexity of two constructions of binary sequences with period \(4N\) and optimal autocorrelation magnitude
- Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\)
- Constructions of almost difference sets from finite fields
- Constructions of \((q,K,\lambda, t,Q)\) almost difference families
- On the linear complexity of Legendre-Sidelnikov sequences
- 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
- Correlation of the two-prime Sidel'nikov sequence
- Pseudo-randomness of certain sequences of k symbols with length pq
- A note on binary sequence pairs with two-level correlation
- The linear complexity of new generalized cyclotomic binary sequences of order four
- Cryptographic properties of some binary generalized cyclotomic sequences with the length \(p^{2}\)
- New \(M\)-ary sequences with low autocorrelation from interleaved technique
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)
- Additive character sums of polynomial quotients
- Two Boolean functions with five-valued Walsh spectra and high nonlinearity
- On the linear complexity of Ding-Helleseth generalized cyclotomic binary sequences of order four and six
- 2-adic complexity of two classes of generalized cyclotomic binary sequences
- Generalized cyclotomic numbers of order two and their applications
- Autocorrelation values of new generalized cyclotomic sequences of order six over \(\mathbb Z_{pq}\)
- Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length pq
- Some Notes on the Two-Prime Generator of Order<tex>$2$</tex>
- Linear complexity of cyclotomic sequences of order six and BCH codes over \(\mathrm{GF}(3)\)
- On the autocorrelation of cyclotomic generators
- The linear complexity problem of a binary Jacobi sequence
- Autocorrelation values of Whiteman generalized cyclotomic sequences
- On the k-error linear complexity of binary sequences derived from polynomial quotients
- 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\)
- Generalized cyclotomic sequences of order four over \(\mathbb Z_{pq}\) and their autocorrelation values
- A note on cyclic almost difference families
- Autocorrelation of the modified binary two-prime Sidelnikov sequence
- Linear complexity of Ding generalized cyclotomic sequences
- 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 symmetric 2-adic complexity of periodic binary sequences
- Construction of quaternary sequences of length \(pq\) with low autocorrelation
- Trace representation of a family of generalized cyclotomic binary sequences with period p^n
- The existence of almost difference families
- Linear complexity and correlation of a class of binary cyclotomic sequences
- Constructions of almost difference families
- Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
- The existence of \((q,k,\lambda ,t)\)-ADFs for \(k=4,5,6\)
This page was built for publication: Autocorrelation values of generalized cyclotomic sequences of order two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701151)