跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.25940 · v1

Self-Orthogonal MDS Principal-Ideal Codes

首次提交 2026-11-19 19:24
版本更新 2026-11-19 19:24
雷达观测 2026-11-20 16:53
arXiv ↗PDF ↗

摘要

We investigate Euclidean self-orthogonality and the generalized Reed--Solomon (GRS) property for coefficient-vector codes generated by a monic polynomial gg and its shifts xg,…,xk−1gxg,\ldots,x^{k-1}g, of length n=r+kn=r+k and dimension kk, where °g=r°g=r and 3≤k≤r3\le k\le r. We give a complete classification, over any algebraically closed field, of the generators for which these codes are both self-orthogonal and GRS. Such generators have either distinct roots in a geometric progression satisfying explicit order and scalar conditions, or a single repeated root in certain positive characteristics. In particular, only finitely many generators occur for fixed rr, kk, and characteristic. We determine their maximal self-orthogonal lengths, show that the corresponding maximal-length codes are cyclic or negacyclic, and obtain exact generator counts over finite fields, together with the least fields of definition. In contrast, when 3≤k<r3\le k<r, we prove that every algebraically closed field supports infinitely many pairwise monomially inequivalent self-orthogonal non-GRS maximum distance separable (MDS) codes in this family. Consequently, arbitrarily many such codes can be realized over a common finite extension of any prescribed finite field, while remaining inequivalent and non-GRS over its algebraic closure.

作者备注:15 pages

AI 论文解读

基于摘要 · 非全文审阅

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

版本差异

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

观测到的版本

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

v1 · 2026-11-19 19:24 · 最新观测版本

Self-Orthogonal MDS Principal-Ideal Codes

We investigate Euclidean self-orthogonality and the generalized Reed--Solomon (GRS) property for coefficient-vector codes generated by a monic polynomial gg and its shifts xg,…,xk−1gxg,\ldots,x^{k-1}g, of length n=r+kn=r+k and dimension kk, where °g=r°g=r and 3≤k≤r3\le k\le r. We give a complete classification, over any algebraically closed field, of the generators for which these codes are both self-orthogonal and GRS. Such generators have either distinct roots in a geometric progression satisfying explicit order and scalar conditions, or a single repeated root in certain positive characteristics. In particular, only finitely many generators occur for fixed rr, kk, and characteristic. We determine their maximal self-orthogonal lengths, show that the corresponding maximal-length codes are cyclic or negacyclic, and obtain exact generator counts over finite fields, together with the least fields of definition. In contrast, when 3≤k<r3\le k<r, we prove that every algebraically closed field supports infinitely many pairwise monomially inequivalent self-orthogonal non-GRS maximum distance separable (MDS) codes in this family. Consequently, arbitrarily many such codes can be realized over a common finite extension of any prescribed finite field, while remaining inequivalent and non-GRS over its algebraic closure.

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