On the maximum number of minimal codewords (Q2037586)

The authors determine the maximum number of minimal codewords \(M_2(n,k)\) for binary linear codes of dimension \(k\) and length \(n=k + 2\). In the case of dimension \(k\) and length \(k + 3\), they give a formula for the number of minimal codewords. The results are based on the more general properties of minimal codewords proved by authors in the paper. For values of \(n\) and \(k\) in \([1,15]\) a table with the exact values of \(M_2(n,k)\) is given, too.