Alternating-string conjecture for minimal autocorrelation
Statement
Let be a binary string of length , and let denote its autocorrelation coefficient. The alternating string is .
Alternating-string conjecture. The alternating string minimizes the autocorrelation coefficient .
The paper presents this as an unresolved minimization problem, contrasting it with the proved maximization by the constant all-zero and all-one strings.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.