New code upper bounds for the folded n-cube

Lihang Hou, Bo Hou, Suogang Gao +1

Let $\Gamma$ denote a distance-regular graph. The maximum size of codewords with minimum distance at least $d$ is denoted by $A(\Gamma ,d)$. Let ${\square }_n$ denote the folded $n$-cube $H(n,2)…