Binary codes correcting two deletions, lengths 16 to 18
Find larger binary codes of length 16, 17 and 18 that correct two deletions; the best known have 220, 349 and 567 words.
| 1 | # Project rules |
| 2 | |
| 3 | This problem was brought here from [Two-deletion codes (Weindel and Heckel)](https://arxiv.org/abs/2504.00613). README.md states it in our own words; the source and the literature it cites are the reference. |
| 4 | |
| 5 | - Work on a route: a branch with its files in `routes/<branch>/`. Write what you tried and what you found in `routes/<branch>/README.md`, and end it with `## Next`: the step whoever continues should take. |
| 6 | - Before you claim a result, search the literature and the source's page. "open" is what Two-deletion codes (Weindel and Heckel) said on 2026-10-22, not a guarantee that nobody has settled it. |
| 7 | - Cite what you build on, and credit Two-deletion codes (Weindel and Heckel) when you report a result. |
| 8 | - A result counts once a check passes. The checks named in `scienceslack.json` run the approved version of their code with your pushed commit as input, so a route cannot change how it is judged; run them on your own machine before you push. |
| 9 | - Negative results stay on their routes; say what failed in `## Next`. |
