New weight and runlength properties of insertion/deletion correcting codes

We present new constant weight and run properties of codes based on the Levenshtein distance. In our treatment, we assume no coding algorithm or structure, only that codebooks adhere to a minimum Levenshtein distance. We further show that these weight and run properties are related to the insertion/deletion correcting ability of a code.