C. Thomassen

The maximum number of minimal codewords in an $[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.