arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1003.4057cs.ITmath.IT
收藏

删除和插入度量下最优码的构造

Construction of optimal codes in deletion and insertion metric

Hyun Kwang Kim, Joon Yop Lee, Dong Yeol Oh

摘要:

我们改进Levenshtein的上限的基数的代码长度为4,能够纠正单删除一个字母的大小均匀。我们还说明了新的上界是尖锐的。此外,我们构造了一个最佳的完美的代码,是能够纠正单一的删除相同的参数。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑