New code upper bounds for the folded n-cube

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

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


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.

Original languageEnglish
Article number105182
JournalJournal of Combinatorial Theory. Series A
StatePublished - May 2020


  • Code
  • Semidefinite programming
  • Terwilliger algebra
  • Upper bounds


Dive into the research topics of 'New code upper bounds for the folded n-cube'. Together they form a unique fingerprint.

Cite this