ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HqnH_q^n be the Hamming space over an alphabet of size qq, and let C⊆HqnC\subseteq H_q^n be an equidistant code with distance dd. Hegedüs' conjecture. If

d≠(q−1)(n+1)q,d\neq \frac{(q-1)(n+1)}{q},

then

∣C∣≤n(q−1).|C|\leq n(q-1).

This conjecture generalizes Hegedüs' sharper upper bound in the binary case, where the corresponding result is known for distances different from (n+1)/2(n+1)/2; the general qq-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.