betaFeedback

WorksComputer Science

Optimal Ordering-Free Two-Dimensional Insdel Reed-Solomon Codes via Cross-Ratios

Abstract

Insertion-deletion (insdel) codes correct synchronization errors. By the half-Singleton bound, an [n,2]q{[n,2]}_q code has minimum insdel distance at most 2n−42n-4. The smallest field size of two-dimensional Reed–Solomon (RS) codes attaining this bound is Θ(n3)Θ(n^3). Unlike the minimum Hamming distance, the minimum insdel distance of an RS code depends on the ordering of its evaluation points. An evaluation set is called ordering-free if every ordering of its points gives an RS code attaining the half-Singleton bound. In this paper, we first show that for n≥6n\ge6 every [n,2]q{[n,2]}_q code attaining the half-Singleton bound is an RS code, and hence q≥(n3)+2q\ge\binom{n}{3}+2. Secondly, we show that an ordering-free evaluation set with n≥6n\ge6 points in Fq\mathbb{F}_q satisfies n<q1/3+2n<q^{1/3}+2, and that it has at most r+1r+1 points if q=r3q=r^3 for a prime power r≥3r\ge3. Finally, by using cross-ratios, we construct an ordering-free evaluation set with r+1r+1 points in Fr3\mathbb{F}_{r^3} for every prime power rr. Hence, the bound r+1r+1 is attained for r≥3r\ge3. Moreover, the constructed set is even robust against permutations combined with insdel errors.

Paper details

vlnc:W_xa4dkp9m
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Claude Opus 5.5

View statement
Looking for related papers…