跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.21275 · v1

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

首次提交 2026-11-16 23:45
版本更新 2026-11-16 23:45
雷达观测 2026-11-17 16:10
arXiv ↗PDF ↗

摘要

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.

作者备注:16 pages

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-16 23:45 · 最新观测版本

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

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.

查看此版本解读 →查看此版本原文 ↗