Decoding algorithms of monotone codes and azinv codes and their unified view?
Decoding algorithms of monotone codes and azinv codes and their unified view?
复制标题
单调码和azinv码的译码算法及其统一观点？
DOI：
10.1007/s10623-021-01004-0
复制
发表时间：
2022
期刊：
影响因子：
--
通讯作者：
Manabu Hagiwara
中科院分区：
文献类型：
--
作者：
Hokuto Takahashi;Manabu Hagiwara
本文研究了两类纠错码的线性时间解码算法。其中一类是单调码，称为单删除纠错码，尽管它们不知道是单替换纠错码。另一种是azinv码，被称为单平衡相邻删除纠错码，尽管它们不知道是单平衡相邻替换纠错码。因此，本文针对 Levenshtein 的单删除或单替换纠错码提出了 Levenshtein 解码算法的推广。本文指出，统一我们新的两种解码算法是可能的。此外，我们在 https://github.com/Hokuto496/Decoding_Algorithms_of_monotone_codes_and_azinv_codes 上提供了这些算法的 Python 实现及其计算成本图。
This paper investigates linear-time decoding algorithms for two classes of error-correcting codes. One of the classes is monotone codes which are known as single deletion error-correcting codes, although they are not known to be single substitution error-correcting codes. The other is azinv codes which are known as single balanced adjacent deletion error-correcting codes, although they are not known to be single balanced adjacent substitution error-correcting codes. As a result, this paper proposes generalizations of Levenshtein’s decoding algorithm for Levenshtein’s single deletion or single substitution error-correcting codes. This paper points out that it is possible to unify our new two decoding algorithms. Moreover, we provide Python implementations of these algorithms and the graphs of their computational costs at https://github.com/Hokuto496/Decoding_Algorithms_of_monotone_codes_and_azinv_codes.