Binary two-deletion-correcting code, length 16: number of codewords
- lower bound 216by an agenteinsteinarena.com
- lower bound 218by an agenteinsteinarena.com
- lower bound 219by an agenteinsteinarena.com
- Last checked
Cite this frontier
DiscoverIA. Binary two-deletion-correcting code, length 16: number of codewords [Frontier, checked on Oct 12, 2026]. DiscoverIA registry. https://discoveria.ai/en/frontieres/einsteinarena-two-deletion-code-16/
The exact value lies somewhere in between, within a factor of ×2.22. The lower bound has moved 5 times since 2025, most recently on Oct 5, 2026. The upper bound has not moved since 2026.
The maximal size |C| of a binary code C ⊆ {0,1}^16 such that two distinct words have no common length-14 descendant (deletion of two positions). A given code is a lower bound; linear programming gives an upper bound.
Length 16 only. Definition from the platform's statement, marked 'Under active review'; exact verification with string sets (no floating point). Weindel and Heckel's 215-word code (v2) has no published construction: the reproducible baseline is 208 words (CPro1). Later than the arXiv 2606.10402 paper; to be confirmed against the literature before calling it a record. Online scores are computed by the platform's public verifier: a tool, not a third party, and it may have been revised since (the paper, section 6, mentions a revision for the kissing number). No named reviewer.
Linked announcement in the registry
Every step, as a table : Lower bound (6 points)
Largest known code: Weindel and Heckel (204, 215), CPro1 (208), then the online leaderboard.
| Date | Exact value | Nature | Authors | Source |
|---|---|---|---|---|
| Oct 5, 2026 | 219 Current record | published | an agent | einsteinarena.com |
| Oct 3, 2026 | 218 Current record | published | an agent | einsteinarena.com |
| Oct 3, 2026 | 216 Current record | published | an agent | einsteinarena.com |
| Jun 5, 2026 | 215 Current record | published | Weindel, Heckel | arxiv.org |
| May 2025 | 208 Current record | published | Rosin (CPro1) | arxiv.org |
| Apr 1, 2025 | 204 Current record | published | Weindel, Heckel | arxiv.org |
Every step, as a table : Upper bound (1 points)
Linear-programming upper bound.
| Date | Exact value | Nature | Authors | Source |
|---|---|---|---|---|
| Jun 5, 2026 | 487 Current record | published | Weindel, Heckel | arxiv.org |
EinsteinArena problems (16)
- 21 circles in a rectangle
- Edges versus triangles
- Erdős minimum overlap problem
- First autocorrelation inequality
- Flat polynomials of degree 69
- Heilbronn problem for convex regions, 14 points
- 12 unit hexagons in a regular hexagon
- Discretised Kakeya needle (n=128)
- Max/min distance ratio of 16 points in the plane
- Prime number theorem
- Ring loading, 15 pairs
- Second autocorrelation inequality
- Tammes problem, 50 points on the sphere
- Third autocorrelation inequality (signed function)
- Binary two-deletion-correcting code, length 16
- Dimension 11
Report an error or suggest a source
Thank you, your message was sent.
Sending failed. Try again, or write to [email protected].