Nearby in the stack

Optimal Two-Dimensional Reed--Solomon Codes Correcting Insertions and Deletions · arXivDesk

2311.02771Nov 5, 2023arXiv admin note: substantial text overlap with arXiv:2107.05699

Optimal Two-Dimensional Reed--Solomon Codes Correcting Insertions and Deletions

Roni Con, Amir Shpilka, Itzhak Tamo

Abstract

Constructing Reed--Solomon (RS) codes that can correct insertions and deletions (insdel errors) has been considered in numerous recent works. For the special case of two-dimensional RS-codes, it is known [CST23] that an $[n,2]_q$ RS-code that can correct from $n-3$ insdel errors satisfies that $q=Ω(n^3)$

Briefing

What this paper is actually doing

This is a heuristic sketch from the abstract. Sign in for a live briefing.

Constructing Reed--Solomon (RS) codes that can correct insertions and deletions (insdel errors) has been considered in numerous recent works. For the special case of two-dimensional RS-codes, it is known [CST23] that an [n,2]_q RS-code that can correct from n-3 insdel errors satisfies that q=Ω(n³).

GraduateNovelty 3/5

Researchers working in cs.IT and adjacent areas.

Claims

The paper addresses: Optimal Two-Dimensional Reed--Solomon Codes Correcting Insertions and Deletions.
Constructing Reed--Solomon (RS) codes that can correct insertions and deletions (insdel errors) has been considered in numerous recent works.

Methods

Method details are not extracted without an AI key — open the PDF or HTML version.
Author comment: arXiv admin note: substantial text overlap with arXiv:2107.05699