arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1203.0728cs.ITmath.COmath.IT
收藏

$[n,k]-$码中最小码字的最大数目

The maximum number of minimal codewords in an $[n,k]-$code

A. Alahmadi, R. E. L. Aldred, R. dela Cruz, P. Solé, C. Thomassen

摘要:

本文导出了标题中的量的上、下界,并对$n$和$k.$的适度值进行了列表。

英文摘要:

Upper and lower bounds are derived for the quantity in the title, which is tabulated for modest values of $n$ and $k.$ An application to graphs with many cycles is given.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑