New code upper bounds for the folded n-cube

Lihang Hou, Bo Hou, Suogang Gao, Wei Hsuan Yu

研究成果: 雜誌貢獻期刊論文同行評審

3 引文 斯高帕斯(Scopus)

摘要

Let □n denote the folded n-cube and let A(□n,d) denote the maximum size of a code in □n with minimum distance at least d. We give an upper bound on A(□n,d) based on block-diagonalizing the Terwilliger algebra of □n and on semidefinite programming. The technique of this paper is an extension of the approach taken by A. Schrijver [11] on the study of upper bounds for binary codes.

原文???core.languages.en_GB???
文章編號105182
期刊Journal of Combinatorial Theory. Series A
172
DOIs
出版狀態已出版 - 5月 2020

指紋

深入研究「New code upper bounds for the folded n-cube」主題。共同形成了獨特的指紋。

引用此