Conjecture on the merit factor of Gordon-Mills-Welch sequences
Let and let be a subfield of size , where divides . Let be primitive in , let be coprime to , and let the Gordon-Mills-Welch sequence of length be the coefficient sequence of
Its negaperiodic and periodic versions are defined analogously. Gordon-Mills-Welch merit factor conjecture. For each such choice of , , , and , 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.
References
Primary source
Jonathan Jedwab, Daniel J. Katz and Kai-Uwe Schmidt, “Advances in the merit factor problem for binary sequences”, arXiv:1205.0626 (2013).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.