An Improvement of Non-binary Code Correcting Single b-Burst of Insertions or Deletions

TL;DR

This paper introduces a new non-binary code capable of correcting a single burst of insertions or deletions, along with a decoding algorithm and bounds on its size, enhancing error correction capabilities.

Contribution

It constructs a novel non-binary code for burst insertions/deletions, proposes a decoding algorithm, and evaluates bounds on code cardinality.

Findings

Large cardinality of the constructed code

Decoding algorithm effectiveness demonstrated

Bounds on code size established

Abstract

This paper constructs a non-binary code correcting a single $b$-burst of insertions or deletions with a large cardinality. This paper also proposes a decoding algorithm of this code and evaluates a lower bound of the cardinality of this code. Moreover, we evaluate an asymptotic upper bound on the cardinality of codes which correct a single burst of insertions or deletions.