A binary two-deletion-correcting code of length 16 with 216 codewords

A binary code of length 16 with 216 codewords that corrects two deletions: no two codewords share a subsequence of length 14. The largest previously reported code of this kind has 215 codewords (Weindel and Heckel, arXiv 2504.00613 v2, June 2026, found with the MIS solvers OnlineMIS and ReduMIS; we did not find the code in the paper or the authors' public repository). The largest previously published code has 209 (EinsteinArena, problem 34); before it, 208 (CPro1, arXiv 2505.23881). The linear programming upper bound is 487. Values consulted on 29 September 2026. The code is closed under bit complement. No optimality is claimed. The deposit contains the codewords as plain text and as JSON, a dependency-free verifier in Python 3, and SHA-256 digests of every file. The verifier generates, for each codeword, all words obtained by deleting two positions and checks that no such word comes from two different codewords. Author affiliation and other benchmark results: Team Banzai S.L.U. (https://team-banzai.com).