Year: 2026
Type: preprint
Abstract: In this paper, we focus on decoding optimal Reed-Solomon codes of dimension two for insdel errors up to the half-Singleton bound. We present a decoding algorithm for the general insertion-and-deletion scenario with a time complexity smaller than brute-force decoding. Our algorithm corrects insdel errors up to the half-Singleton bound, which exceeds the scope of existing methods. Additionally, for the special cases of insertion-only and deletion-only insdel error patterns, we present two different algorithms with a time complexity smaller than our general algorithm.
Source: arXiv (Cornell University)
Authors: Fan, Bencheng, Kuijper, Margreta, Zhu, Jingge
Institution: The University of Melbourne
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7221788480