Efficient Decoding of Insertion and Deletion Errors for Helberg Codes

TL;DR

This paper introduces an efficient decoding algorithm for Helberg codes that can correct multiple insertion and deletion errors, extending previous algorithms for deletions to handle insertions as well.

Contribution

It presents the first efficient decoding method for multiple insertion-deletion errors in Helberg codes and their non-binary generalizations.

Findings

Decoding algorithm corrects multiple insertion and deletion errors.

Algorithm extends previous deletion-only correction methods.

First known efficient decoding for these error types in Helberg codes.

Abstract

We present the first known efficient decoding algorithm for correcting multiple insertion-deletion errors in Helberg codes and their non-binary generalizations, extending a known algorithm for correcting multiple deletion errors.