Two Approaches to the Construction of Deletion Correcting Codes: Weight Partitioning and Optimal Colorings

Daniel Cullina, Ankur A. Kulkarni, Negar Kiyavash

We consider the problem of constructing deletion correcting codes over a binary alphabet and take a graph theoretic view. An $n$-bit $s$-deletion correcting code is an independent…