Hegedüs' conjecture on non-exceptional q-ary equidistant codes
Statement
Let be the Hamming space over an alphabet of size , and let be an equidistant code with distance . Hegedüs' conjecture. If
then
This conjecture generalizes Hegedüs' sharper upper bound in the binary case, where the corresponding result is known for distances different from ; the general -ary case remains open.
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.