| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647710 | Discrete Mathematics | 2013 | 6 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
![The maximum number of minimal codewords in an [n,k]-code](/preview/png/4647710.png "First Page Preview: The maximum number of minimal codewords in an [n,k]-code")
Authors
A. Alahmadi, R.E.L. Aldred, R. de la Cruz, P. Solé, C. Thomassen,