On the autocorrelation of cyclotomic generators
The paper studies the autocorrelation of some \(q\)-periodic sequences \((s_n)\) (the autocorrelation function measures the similarity between the sequence \((s_n)\) and a \(t\)-shift \((s_{n+t}\))). Let \(\mathbb F_q\), \(q=p^r\)\, be a finite field, \(\gamma\) a primitive element and \(d>1\) a divisor of \(q-1\). The paper considers a \(q\)-periodic sequence \((s_n)\) over \(\mathbb Z_d\) defined in terms of the cyclotomic classes of order \(d\). Such a sequence is closely related to the discrete logarithm in \(\mathbb F_q^*\): for an appropriate ordering of the field's elements \(\varepsilon_i\), \(s_n= \log_{\gamma, d}(\varepsilon_n)\), where \(log_{\gamma, d}(\varepsilon)\) denotes the residue class of \(\log_{\gamma}(\varepsilon)\) modulo \(d\). For \(r=1\)\, the sequence is called cyclotomic generator of order \(d\)\, and the value of the autocorrelation of \((s_n)\), \(A_d(p,t)\), is known, see \textit{C. Ding} and \textit{T. Helleseth} [Inform. Process. Lett. 66, No. 1, 21--25 (1998; Zbl 1078.94511)]. For \(r>1\)\, the paper introduces a modified definition \(A_d^{\oplus}(p,t)\)\, of autocorrelation and it is shown (Section 2, Theorem 1) that the expression for the value of \(A_d^{\oplus}(p,t)\)\, is similar to the found for \(A_d(p,t)\). In Section 3, Theorem 2, the authors prove the upper bound \(| A_d(q,t)| = O(q^{-1/2}(\log p)^{r-1})\), where the implied constant only depends on \(r\). Next they consider sequences defined by \(s_n=log_{\gamma, m}(\varepsilon_n)\), where \(m\) is not a divisor of \(d-1\). Finally, in Section 4 the authors define aperiodic autocorrelations \(AA_d^{\oplus}(p,t)\)\, and \(AA_d(p,t)\),\, con\-sidering only parts of the period instead of the full period, obtaining similar results (Theorems 3 and 4). For the entire collection see [Zbl 1048.11003].
- Autocorrelation values of generalized cyclotomic sequences of order two
- Autocorrelation values and linear complexity of new generalized cyclotomic sequences
- Autocorrelation values of Whiteman generalized cyclotomic sequences
- Autocorrelation and linear complexity of binary generalized cyclotomic sequences with period \(pq\)
- Autocorrelation values of quaternary cyclotomic sequence of length \(2p^m\)
- On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\)
- Generalized cyclotomic sequences of order four over \(\mathbb Z_{pq}\) and their autocorrelation values
- Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length pq
- Autocorrelation values of new generalized cyclotomic sequences of order six over \(\mathbb Z_{pq}\)
- Remarks on a cyclotomic sequence
- Measures of pseudorandomness for binary sequences constructed using finite fields
- A new lower bound on the family complexity of Legendre sequences
- On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields
- Improving results on the pseudorandomness of sequences generated via the additive order of a finite field
- The linear complexity of new generalized cyclotomic binary sequences of order four
- On cyclotomic generator of order \(r\).
- On the linear complexity of Ding-Helleseth generalized cyclotomic binary sequences of order four and six
- A Study on the Pseudorandom Properties of Sequences Generated Via the Additive Order
- scientific article; zbMATH DE number 691477 (Why is no real title available?)
- On pseudorandom sequences of \(k\) symbols constructed using finite fields
- Finite binary sequences constructed by explicit inversive methods
This page was built for publication: On the autocorrelation of cyclotomic generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4832273)
