Alahmadi, A.; Aldred, R. E. L.; de la Cruz, R.; Ok, S.; Solé, P.; Thomassen, C. The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes. (English) Zbl 1311.05027 Discrete Appl. Math. 184, 32-39 (2015). MSC: 05B35 94B25 PDFBibTeX XMLCite \textit{A. Alahmadi} et al., Discrete Appl. Math. 184, 32--39 (2015; Zbl 1311.05027) Full Text: DOI
Alahmadi, A.; Aldred, R. E. L.; de la Cruz, R.; Solé, P.; Thomassen, C. The maximum number of minimal codewords in an \([n,k]\)-code. (English) Zbl 1281.94099 Discrete Math. 313, No. 15, 1569-1574 (2013). MSC: 94B60 05B35 05C30 05C38 PDFBibTeX XMLCite \textit{A. Alahmadi} et al., Discrete Math. 313, No. 15, 1569--1574 (2013; Zbl 1281.94099) Full Text: DOI arXiv
Alahmadi, A.; Aldred, R. E. L.; dela Cruz, R.; Solé, P.; Thomassen, C. The maximum number of minimal codewords in long codes. (English) Zbl 1254.05084 Discrete Appl. Math. 161, No. 3, 424-429 (2013). MSC: 05C38 05C35 05B35 94B05 PDFBibTeX XMLCite \textit{A. Alahmadi} et al., Discrete Appl. Math. 161, No. 3, 424--429 (2013; Zbl 1254.05084) Full Text: DOI arXiv