PreprintarXiv licencearXiv
On the lengths of MDS codes with a two-transitive permutation automorphism group
Abstract
Let C be an [n,k]q maximum distance separable (MDS) code with 4≤ k≤ q−3, and suppose that it has a $2$-transitive permutation automorphism group. In this paper we show that n≤ q+1, so the MDS conjecture holds for this class of codes.
Related
- Permutation automorphism groups of cyclic codes I: cyclotomic association schemes
- The permutation and automorphism groups of univariate multiplicity codes
- Mathieu groups as flag-transitive automorphism groups of block designs
- Corrigendum to "Transitive permutation groups with trivial four point stabilizers"
- Transitive automorphism groups of maximal curves
BibTeX
@misc{deng2026lengths,
title = {{On the lengths of MDS codes with a two-transitive permutation automorphism group}},
author = {Haihua Deng and Tao Feng and Andrey V. Vasil'ev},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.05292},
eprint = {2609.05292},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.05292},
}
RIS
TY - UNPB
TI - On the lengths of MDS codes with a two-transitive permutation automorphism group
AU - Haihua Deng
AU - Tao Feng
AU - Andrey V. Vasil'ev
PY - 2026
DA - 2026/09/04
PB - arXiv
DO - 10.48550/arxiv.2609.05292
UR - https://arxiv.org/abs/2609.05292
AB - Let C be an [n,k]_q maximum distance separable (MDS) code with 4≤ k≤ q−3, and suppose that it has a $2$-transitive permutation automorphism group. In this paper we show that n≤ q+1, so the MDS conjecture holds for this class of codes.
ER -