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.
Saved in:
| Main Authors: | , , , , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2013
|
| 在線閱讀: | https://hdl.handle.net/10356/99324 http://hdl.handle.net/10220/17375 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|