An infinite family of antiprimitive cyclic codes supporting Steiner systems $S(3,8, 7^m+1)$
From MaRDI portal
Publication:6379744
DOI10.1007/S10623-022-01032-4zbMath1512.94161arXiv2110.03881WikidataQ114849763 ScholiaQ114849763MaRDI QIDQ6379744
Can Xiang, Chun-Ming Tang, Qi Liu
Publication date: 7 October 2021
Abstract: Coding theory and combinatorial $t$-designs have close connections and interesting interplay. One of the major approaches to the construction of combinatorial t-designs is the employment of error-correcting codes. As we all known, some $t$-designs have been constructed with this approach by using certain linear codes in recent years. However, only a few infinite families of cyclic codes holding an infinite family of $3$-designs are reported in the literature. The objective of this paper is to study an infinite family of cyclic codes and determine their parameters. By the parameters of these codes and their dual, some infinite family of $3$-designs are presented and their parameters are also explicitly determined. In particular, the complements of the supports of the minimum weight codewords in the studied cyclic code form a Steiner system. Furthermore, we show that the infinite family of cyclic codes admit $3$-transitive automorphism groups.
This page was built for publication: An infinite family of antiprimitive cyclic codes supporting Steiner systems $S(3,8, 7^m+1)$
