An Infinite Family of Steiner Systems from Cyclic Codes

Steiner systems are a fascinating topic of combinatorics. The most studied Steiner systems are (Steiner triple systems), (Steiner quadruple systems), and . There are a few infinite families of Steiner systems in the literature. The objective of this paper is to present an infinite family of Steiner systems for all from cyclic codes. As a by‐product, many infinite families of 2‐designs are also reported in this paper.