New code upper bounds for the folded n-cube

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

doi:10.1016/j.jcta.2019.105182

New code upper bounds for the folded n-cube

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

數學系

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

5 引文斯高帕斯（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	https://doi.org/10.1016/j.jcta.2019.105182
出版狀態	已出版 - 5月 2020

存取文件

10.1016/j.jcta.2019.105182

引用此

@article{e7ad7414bbae429f951e3fd7a71a6d99,

title = "New code upper bounds for the folded n-cube",

abstract = "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.",

keywords = "Code, Semidefinite programming, Terwilliger algebra, Upper bounds",

author = "Lihang Hou and Bo Hou and Suogang Gao and Yu, {Wei Hsuan}",

note = "Publisher Copyright: {\textcopyright} 2019 Elsevier Inc.",

year = "2020",

month = may,

doi = "10.1016/j.jcta.2019.105182",

language = "???core.languages.en_GB???",

volume = "172",

journal = "Journal of Combinatorial Theory. Series A",

issn = "0097-3165",

}

TY - JOUR

T1 - New code upper bounds for the folded n-cube

AU - Hou, Lihang

AU - Hou, Bo

AU - Gao, Suogang

AU - Yu, Wei Hsuan

PY - 2020/5

Y1 - 2020/5

N2 - 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.

AB - 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.

KW - Code

KW - Semidefinite programming

KW - Terwilliger algebra

KW - Upper bounds

UR - http://www.scopus.com/inward/record.url?scp=85076174899&partnerID=8YFLogxK

U2 - 10.1016/j.jcta.2019.105182

DO - 10.1016/j.jcta.2019.105182

M3 - 期刊論文

AN - SCOPUS:85076174899

SN - 0097-3165

VL - 172

JO - Journal of Combinatorial Theory. Series A

JF - Journal of Combinatorial Theory. Series A

M1 - 105182

ER -

New code upper bounds for the folded n-cube

摘要

存取文件

指紋

引用此