Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances

IEEE Transactions on Information Theory(2021)

引用 2|浏览34
暂无评分
摘要
We employ signed measures that are positive definite up to certain degrees to establish Levenshtein-type upper bounds on the cardinality of codes with given minimum and maximum distances, and universal lower bounds on the potential energy (for absolutely monotone interactions) for codes with given maximum distance and cardinality. The distance distributions of codes that attain the bounds are found in terms of the parameters of Levenshtein-type quadrature formulas. Necessary and sufficient conditions for the optimality of our bounds are derived. Further, we obtain upper bounds on the energy of codes of fixed minimum and maximum distances and cardinality.
更多
查看译文
关键词
Bounds for codes,linear programming,energy of codes
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要