Decoding algorithms of monotone codes and azinv codes and their unified view

04/15/2020

∙

by   Hokuto Takahashi, et al.

∙

0

∙

share

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 codes. The other is azinv codes which are known as single balanced adjacent deletion codes. As results, this paper proposes generalizations of Levenshtein's decoding algorithm for Levenshtein's single deletion codes. This paper points out that it is possible to unify our new two decoding algorithms.