DocumentCode
1517017
Title
Optimal Single Deletion Correcting Code of Length Four Over an Alphabet of Even Size
Author
Kim, Hyun Kwang ; Lee, Joon Yop ; Oh, Dong Yeol
Author_Institution
Dept. of Math., POSTECH, Pohang, South Korea
Volume
56
Issue
7
fYear
2010
fDate
7/1/2010 12:00:00 AM
Firstpage
3217
Lastpage
3220
Abstract
We improve Levenshtein´s upper bound for the cardinality of a code of length four that is capable of correcting single deletions over an alphabet of even size. We also illustrate that the new upper bound is sharp. Furthermore we construct an optimal perfect code that is capable of correcting single deletions for the same parameters.
Keywords
error correction codes; optimal perfect code; optimal single deletion correcting code; single deletion correction; Codes; Educational programs; Educational technology; Materials science and technology; Mathematics; Upper bound; Deletion and insertion distance; Levenshtein´s bound; Steiner quadruple system; group divisible system; perfect code;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2010.2048492
Filename
5485000
Link To Document