Conjecture on the merit factor of Sidelnikov sequences
Conjecture on the merit factor of Sidelnikov sequences
Let be an odd prime power, let be primitive in , and let be the Sidelnikov sequence of length with respect to . Let denote merit factor, and let 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 , choose an integer and a primitive . If and as , then
as . 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
Sign in to submit a solution.
No solutions have been posted yet.