Optimal single deletion correcting code of length four over an alphabet of even size
SCIE
SCOPUS
- Title
- Optimal single deletion correcting code of length four over an alphabet of even size
- Authors
- Kim, HK; Lee, JY; Oh, DY
- Date Issued
- 2010-07
- Publisher
- IEEE
- 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
- Deletion and insertion distance; group divisible system; Levenshtein' s bound; perfect code; Steiner quadruple system
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/25748
- DOI
- 10.1109/TIT.2010.2048492
- ISSN
- 0018-9448
- Article Type
- Article
- Citation
- IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 56, no. 7, page. 3217 - 3220, 2010-07
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.