The maximum number of minimal codewords in an [n,k]−[n,k]-code

Upper and lower bounds are derived for the quantity in the title, which is tabulated for modest values of $n$ and $k.$ An application to graphs with many cycles is given.Comment: 6 pp. Submitte

On the minimum number of minimal codewords

We study the minimum number of minimal codewords in linear codes from the point of view of projective geometry. We derive bounds and in some cases determine the exact values. We also present an extension to minimal subcode supports.Comment: 8 pages, 1 tabl

On the number of minimal codewords in codes generated by the adjacency matrix of a graph

Minimal codewords have applications in decoding linear codes and in cryptography. We study the number of minimal codewords in binary linear codes that arise by appending a unit matrix to the adjacency matrix of a graph.Comment: 11 page