Optimal codes in deletion and insertion metric Export

@article{citeulike:3441057, 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.}, archivePrefix = {arXiv}, author = {Kim, Hyun K. and Lee, Joon Y. and Oh, Dong Y.}, citeulike-article-id = {3441057}, citeulike-linkout-0 = {http://arxiv.org/abs/0810.3729}, citeulike-linkout-1 = {http://arxiv.org/pdf/0810.3729}, eprint = {0810.3729}, keywords = {combinatorics, computation, information-theory, mathematics}, month = {Oct}, posted-at = {2008-10-22 19:07:52}, priority = {2}, title = {Optimal codes in deletion and insertion metric}, url = {http://arxiv.org/abs/0810.3729}, year = {2008} }

TY - JOUR ID - citeulike:3441057 L3 - citeulike-article-id:3441057 N2 - 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. TI - Optimal codes in deletion and insertion metric KW - combinatorics KW - computation KW - information-theory KW - mathematics AU - Kim, Hyun AU - Lee, Joon AU - Oh, Dong PY - 2008/Oct/21/ UR - http://arxiv.org/abs/0810.3729 ER -