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

Haihua Deng, Tao Feng, Andrey V. Vasil'ev

Source record

Source: arXiv

Published: Sep 4, 2026

arXiv: 2609.05292

Open original source ↗

Source 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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.