Optimal codes in deletion and insertion metric
classification
💻 cs.IT
cs.DMmath.COmath.IT
keywords
boundcapablecodecorrectingdeletionsoptimalsingleupper
read the original abstract
We improve the upper bound of Levenshtein for the cardinality of a code of length 4 capable of correcting single deletions over an alphabet of even size. We also illustrate that the new upper bound is sharp. Furthermore we will construct an optimal perfect code capable of correcting single deletions for the same parameters.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.