Work

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

Year: 2026

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2609.05292

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

Language: English

Topic: Coding theory and cryptography

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

Funders: National Natural Science Foundation of China, China Postdoctoral Science Foundation, Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences

Awards: G1500783158, G304922999, G3602235587

OpenAlex ID: W7211917399

Cites: 2

Cited by: 3

Related to: 10