Sali's conjecture on the extremal size of Armstrong codes
Statement
Let denote the maximum length for which a -Armstrong code exists. Sali's conjecture. For all ,
The construction from orthogonal double covers gives the lower bound , and the conjecture asserts that this bound is always tight. It is false.
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.