Semidefinite Programming Bounds for Constant-Weight Codes

DOI10.1109/TIT.2018.2854800MaRDI QIDQ4611411zbMATH OpenWikidataFDO

Authors Sven C. Polak

Publication date 18 January 2019

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1703.05171

Mathematics Subject Classification ID

Semidefinite programming (90C22) Linear codes (general theory) (94B05)

Abstract: For nonnegative integers $n,d,w$, let $A(n,d,w)$ be the maximum size of a code $Csubseteqmathbb{F}_2^n$ with constant weight $w$ and minimum distance at least $d$. We consider two semidefinite programs based on quadruples of code words that yield several new upper bounds on $A(n,d,w)$. The new upper bounds imply that $A(22,8,10)=616$ and $A(22,8,11)=672$. Lower bounds on $A(22,8,10)$ and $A(22,8,11)$ are obtained from the $(n,d)=(22,7)$ shortened Golay code of size $2048$. It can be concluded that the shortened Golay code is a union of constant weight $w$ codes of sizes $A(22,8,w)$.

Cited in

(10)

• Symmetry reduction to optimize a graph-based polynomial from queueing theory
• Semidefinite programming bounds for binary codes from a split Terwilliger algebra
• Semidefinite programming bounds for Lee codes
• On the size of maximal binary codes with 2, 3, and 4 distances
• On the weight hierarchy of the semiprimitive codes
• Eigenvalue bounds on the pseudocodeword weight of expander codes
• Asymptotically optimal constant weight codes with even distance
• Approximate generalized Steiner systems and near-optimal constant weight codes
• Improved linear programming bound on sizes of doubly constant-weight codes
• Uniqueness of codes using semidefinite programming

This page was built for publication: Semidefinite Programming Bounds for Constant-Weight Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4611411)