REVIEW
New code upper bounds for the folded n-cube
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
New code upper bounds for the folded n-cube
read the original abstract
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)$. We give an upper bound on $A(\square_n,d)$ based on block-diagonalizing the Terwilliger algebra of $\square_n$ and on semidefinite programming.The technique of this paper is an extension of the approach taken by A. Schrijver \cite{s} on the study of $A(H(n,2),d)$.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.