Linear codes from support designs of ternary cyclic codes (Q2115741)

Let \(C\) denote the linear code generated by the supports of the codewords of minimum weight in a certain ternary linear code \(C(\ell,3^m)\). This family of supports is a 2-design. Under minimum conditions, the authors are able to prove that \(C\) is a \([3^m, 2m^2+m+1, d\geq 3^{m-2}]\) linear code. See also: [\textit{Y. Liu} and \textit{X. Cao}, Cryptogr. Commun. 14, No. 2, 215--227 (2022; Zbl 1484.05024); \textit{A. Saeidi}, Commun. Algebra 50, No. 5, 2215--2222 (2022; Zbl 1486.05029); \textit{X. Du} et al., Adv. Math. Commun. 16, No. 1, 157--168 (2022; Zbl 1490.94075); \textit{C. Ding} and \textit{C. Tang}, Cryptogr. Commun. 13, No. 6, 927--949 (2021; Zbl 1494.94051); \textit{Z. He} and \textit{J. Wen}, Cryptogr. Commun. 13, No. 3, 407--423 (2021; Zbl 1495.94143); \textit{R. Wang} et al., Adv. Math. Commun. 15, No. 4, 663--676 (2021; Zbl 1479.05034); \textit{C. Babecki}, J. Fourier Anal. Appl. 27, No. 5, Paper No. 81, 34 p. (2021; Zbl 1472.05030); \textit{G. Falcone} and \textit{M. Pavone}, Des. Codes Cryptography 89, No. 6, 1261--1277 (2021; Zbl 1466.05013); \textit{T. Miezaki}, Des. Codes Cryptography 89, No. 5, 763--780 (2021; Zbl 1469.17028); \textit{T. Can} et al., IEEE Trans. Inf. Theory 66, No. 10, 6104--6120 (2020; Zbl 1452.94122); \textit{L. A. Bassalygo} et al., Probl. Inf. Transm. 56, No. 3, 245--252 (2020; Zbl 1461.05016); translation from Probl. Peredachi Inf. 56, No. 5, 50--58 (2020); \textit{M. Tagami} and \textit{R. Hori}, Graphs Comb. 36, No. 4, 1093--1109 (2020; Zbl 1442.05251); \textit{C. Ding} et al., Des. Codes Cryptography 88, No. 4, 625--641 (2020; Zbl 1454.94123); \textit{V. Maran\b{i}} et al., Univers. J. Math. Math. Sci. 12, No. 2, 85--87 (2019; Zbl 1490.94074)].