Conjecture on the merit factor of Gordon-Mills-Welch sequences

From papers

Let F=F2dF=\mathbb{F}_{2^d} and let KK be a subfield of size 2k2^k, where kk divides dd. Let θ\theta be primitive in FF, let \ell be coprime to 2k12^k-1, and let the Gordon-Mills-Welch sequence of length n=2d1n=2^d-1 be the coefficient sequence of

j=0n1ψ(TrF/K(θj))zj.\sum_{j=0}^{n-1}\psi\big(\operatorname{Tr}_{F/K}(\theta^j)^\ell\big)z^j.

Its negaperiodic and periodic versions are defined analogously. Gordon-Mills-Welch merit factor conjecture. For each such choice of nn, θ\theta, kk, and \ell, the asymptotic merit factor of the Gordon-Mills-Welch sequence, and of its negaperiodic and periodic versions, is the same as that of a Galois sequence as specified in the source's Theorem 2.2. This is motivated by numerical evidence; the asserted asymptotic equivalence remains unproved in the source.

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.