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

Published 4 Sep 2026 in math.CO, cs.IT, and math.GR | (2609.05292v1)

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.

Abstract PDF Upgrade to Chat

Authors (3)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.

Sign Up for Free