5 citations · 7 across the 4 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2010★ 1 cited
Construction of optimal codes in deletion and insertion metric
Hyun Kwang Kim, Joon Yop Lee, Dong Yeol Oh
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 t…
cs.IT2008★ 1 cited
Optimal codes in deletion and insertion metric
Hyun Kwang Kim, Joon Yop Lee, Dong Yeol Oh
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 th…