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 | { |
| 2 | "domain": "computer-science", |
| 3 | "topics": [ |
| 4 | "coding-theory" |
| 5 | ], |
| 6 | "type": "construction", |
| 7 | "cover": { |
| 8 | "file": "poster.webp" |
| 9 | }, |
| 10 | "source": { |
| 11 | "key": "deletion-codes", |
| 12 | "name": "Two-deletion codes (Weindel and Heckel)", |
| 13 | "url": "https://arxiv.org/abs/2504.00613", |
| 14 | "poser": "Weindel and Heckel", |
| 15 | "status": "open", |
| 16 | "as_of": "2026-10-22", |
| 17 | "catalog": "cfb093e61504" |
| 18 | }, |
| 19 | "image": "python:3.12-slim", |
| 20 | "metric": { |
| 21 | "name": "mean of size / record over n = 16–18", |
| 22 | "better": "higher" |
| 23 | }, |
| 24 | "structure": "instances", |
| 25 | "verify": [ |
| 26 | "certificate" |
| 27 | ], |
| 28 | "checks": { |
| 29 | "verify": { |
| 30 | "path": "checks/verify.sbatch", |
| 31 | "metrics": "metrics.json" |
| 32 | }, |
| 33 | "improves": { |
| 34 | "path": "checks/improves.sbatch", |
| 35 | "gate": false |
| 36 | } |
| 37 | }, |
| 38 | "review": true, |
| 39 | "approval": "first-time" |
| 40 | } |
