{2,4}-distance code conjecture
For an integer , let denote the maximum cardinality of a code such that for every pair of distinct codewords . The conjecture asserts that for and , one has .
References
- The Ternary and Quaternary Cases of the {2,4}-Distance Code Conjecture — arXiv — Yen-Chi Roger Lin, Valjakas Djaljapayan, Wei-Hsuan Yu
Source: arXiv
Progress summary
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 .
Known results
- For and , the conjectured value is ; the case was already known.
- The binary distance- analogue satisfies for .
October 22, 2026 claimed completion
Yen-Chi Roger Lin, Valjakas Djaljapayan, and Wei-Hsuan Yu claim proofs of the and 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 and cases are claimed proved but remain unverified here; the full family of alphabet sizes is open.
Solutions 0
No solutions have been posted yet.