The maximum number of minimal codewords in an [n,k]-code
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.
| Autori principali: | , , , , |
|---|---|
| Altri autori: | |
| Natura: | Journal Article |
| Lingua: | English |
| Pubblicazione: |
2013
|
| Accesso online: | https://hdl.handle.net/10356/99324 http://hdl.handle.net/10220/17375 |