摘要 : It is shown that the minimal distance d of a binary self-dual code of length n<or=74 is at most 2((n+6)/10). This bound is a consequence of some new conditions on the weight enumerator of a self-dual code obtained by considering a... 展开
作者 | Conway~ J.H. Sloane~ N.J.A. |
---|---|
期刊名称 | 《IEEE Transactions on Information Theory》 |
页码/总页数 | P.1319-1333 / 15 |
语种/中图分类号 | 英语 / TN |
关键词 | Upper bound Mathematics |
DOI | 10.1109/18.59931 |
馆藏号 | IELEP0138 |