The maximum number of minimal codewords in long codes
Upper bounds on the maximum number of minimal codewords in a binary code follow from the theory of matroids. Random coding provides lower bounds. In this paper, we compare these bounds with analogous bounds for the cycle code of graphs. This problem (in the graphic case) was considered in 1981 by En...
Saved in:
| Main Authors: | , , , , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2013
|
| 在線閱讀: | https://hdl.handle.net/10356/99215 http://hdl.handle.net/10220/17374 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|