Skip to content

Self-Orthogonal MDS Principal-Ideal Codes

Yangcheng Li, Pingzhi Yuan

cs.ITarXiv:2611.25940

Abstract

We investigate Euclidean self-orthogonality and the generalized Reed--Solomon (GRS) property for coefficient-vector codes generated by a monic polynomial g and its shifts xg,…,xk-1g, of length n=r+k and dimension k, where °g=r and 3 k 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 r, k, 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<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.

Create a lesson