Steiner systems $S(2, 4, \frac{3^m-1}{2})$ and $2$-designs from ternary linear codes of length $\frac{3^m-1}{2}$

TL;DR

This paper constructs and analyzes specific ternary linear codes, revealing their associated Steiner systems and 2-designs, even when they do not meet traditional design criteria, thus confirming recent conjectures in the field.

Contribution

It introduces new ternary linear codes and proves they generate Steiner systems and 2-designs, expanding understanding beyond classical conditions like the Assmus-Mattson theorem.

Findings

Identified three-weight subcodes with unique weight distributions.

Proved these codes hold 2-designs despite not satisfying classical theorems.

Confirmed conjectures on Steiner systems and 2-designs from ternary projective codes.

Abstract

Coding theory and $t$-designs have close connections and interesting interplay. In this paper, we first introduce a class of ternary linear codes and study their parameters. We then focus on their three-weight subcodes with a special weight distribution. We determine the weight distributions of some shortened codes and punctured codes of these three-weight subcodes. These shortened and punctured codes contain some codes that have the same parameters as the best ternary linear codes known in the database maintained by Markus Grassl at http://www.codetables.de/. These three-weight subcodes with a special weight distribution do not satisfy the conditions of the Assmus-Mattson theorem and do not admit $2$-transitive or $2$-homogeneous automorphism groups in general. By employing the theory of projective geometries and projective generalized Reed-Muller codes, we prove that they still hold $2$-designs. We also determine the parameters of these $2$-designs. This paper mainly confirms some recent conjectures of Ding and Li regarding Steiner systems and $2$-designs from a special type of ternary projective codes.