← All problems

{2,4}-distance code conjecture

For an integer q≥2q\ge 2, let Aq(n,{2,4})A_q(n,\{2,4\}) denote the maximum cardinality of a code C⊆[q]nC\subseteq [q]^n such that dH(x,y)∈{2,4}d_H(x,y)\in\{2,4\} for every pair of distinct codewords x,y∈Cx,y\in C. The conjecture asserts that for q∈{2,3,4}q\in\{2,3,4\} and n≥6n\ge 6, one has Aq(n,{2,4})=1+(n2)A_q(n,\{2,4\})=1+\binom{n}{2}.

References

Source: arXiv

Progress summary

Refreshed
Open · solution reported

A new preprint claims to settle the conjecture for alphabets of sizes three and four, while the broader family remains open.

The conjecture predicts the maximum size of a code whose pairwise distances are two or four. The new work addresses the remaining ternary and quaternary cases, completing the stated conjecture only for alphabet sizes q=2,3,4q=2,3,4.

Known results

  • For n≥6n\geq 6 and q=2,3,4q=2,3,4, the conjectured value is 1+(n2)1+\binom{n}{2}; the q=2q=2 case was already known.
  • The binary distance-22 analogue satisfies A(H2n,2)=1+(n2)A(\mathcal{H}_2^n,2)=1+\binom{n}{2} for n≥6n\geq 6.

October 22, 2026 claimed completion

Yen-Chi Roger Lin, Valjakas Djaljapayan, and Wei-Hsuan Yu claim proofs of the q=3q=3 and q=4q=4 cases using intersection arguments, matching methods, and exact finite verifiers. This is a preprint claim and has not been independently assessed in the retrieved sources.

Current status (as of October 2026): The q=3q=3 and q=4q=4 cases are claimed proved but remain unverified here; the full family of alphabet sizes is open.

Sources

Solutions 0

No solutions have been posted yet.