Skip to content
Preprint

On the lengths of MDS codes with a two-transitive permutation automorphism group

Sep 2026 · 0 citations · 43 references
Mathematics Computer Science

Abstract

Let $C$ be an $[n,k]_q$ maximum distance separable (MDS) code with $4\le k\le q-3$, and suppose that it has a $2$-transitive permutation automorphism group. In this paper we show that $n\le q+1$, so the MDS conjecture holds for this class of codes.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.