{"paper":{"title":"New code upper bounds for the folded n-cube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Hou, Lihang Hou, Suogang Gao, Wei-Hsuan Yu","submitted_at":"2018-01-22T06:47:53Z","abstract_excerpt":"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)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06971","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}