Work

Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors

Year: 2024

Type: preprint

Abstract: Constructing Reed-Solomon (RS) codes that can correct insertion and deletion (ins-del) errors has been the focus of several recent studies. However, efficient decoding algorithms for such codes have received less attention and remain a significant open problem. In this work, we take a first step toward addressing this problem by designing a decoding algorithm for the case of $2$-dimensional RS codes that can correct deletions up to the half-Singleton bound and is optimal in terms of field operations.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2412.20771

Author: Singhvi, Shubhransh

Institution: International Institute of Information Technology, Hyderabad

Language: English

Topic: Coding theory and cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4405956868

Cites:

Cited by:

Related to: 10