The maximum number of minimal codewords in an [n,k]-code
Aldred, R. E. L.
de la Cruz, R.
Date of Issue2013
School of Physical and Mathematical Sciences
We survey some upper and lower bounds on the function in the title, and make them explicit for n≤15 and 1≤k≤15. Exact values are given for cycle codes of graphs for 3≤n≤15 and 1≤k≤13.