Optimal codes in deletion and insertion metric
Information Theory
2010-03-23 v2 Discrete Mathematics
Combinatorics
math.IT
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.
Keywords
Cite
@article{arxiv.0810.3729,
title = {Optimal codes in deletion and insertion metric},
author = {Hyun Kwang Kim and Joon Yop Lee and Dong Yeol Oh},
journal= {arXiv preprint arXiv:0810.3729},
year = {2010}
}
Comments
19 pages,The material of this paper was presented in part at the 10th International Workshop on Algebraic and Combinatorial Coding Theory, Zvenigorod, Russia, September 2006