Conjecture on the merit factor of Sidelnikov sequences

From papers

Let qq be an odd prime power, let θ\theta be primitive in Fq\mathbb{F}_q, and let Zn,θZ_{n,\theta} be the Sidelnikov sequence of length n=q1n=q-1 with respect to θ\theta. Let FF denote merit factor, and let h(T)h(T) be the asymptotic function for Galois sequences specified in the source's Theorem 2.2(i). Sidelnikov merit factor conjecture. For each odd prime power qq, choose an integer rr and a primitive θFq\theta\in\mathbb{F}_q. If T>0T>0 and t/nTt/n\to T as nn\to\infty, then

F(Zn,θr,t)h(T)F\bigl(Z_{n,\theta}^{r,t}\bigr)\to h(T)

as nn\to\infty. Numerical evidence motivates the conjecture, and the source does not provide a proof or resolution.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Jonathan Jedwab, Daniel J. Katz and Kai-Uwe Schmidt, “Advances in the merit factor problem for binary sequences”, arXiv:1205.0626 (2013).

Solutions 0

No solutions have been posted yet.