New results on \(s\)-extremal additive codes over \(\mathrm{GF}(4)\) (Q622800)

Summary: The purpose of this paper is to study \(s\)-extremal additive codes over \(\mathrm{GF}(4)\). The concept of \(s\)-extremality was introduced and the \(s\)-extremal additive codes with minimum distance up to 4 were classified by \textit{E. P. Bautista} et al. [Adv. Math. Commun. 1, No. 1, 111--130 (2007; Zbl 1198.94173)]. In this paper, our goal is to construct (or classify if possible) new \(s\)-extremal codes with minimum distance at least 5. For \(d = 5\), we classify the codes of length 13, and we construct 1,075 new codes of length 14. For \(d = 6\), we classify the codes of length 14, and we construct 5 new codes of length 15. For \(d = 7\), we construct four new codes of length 19.