Improved Semidefinite Programming Bound on Sizes of Codes

DOI10.1109/TIT.2013.2277714MaRDI QIDQ5346260zbMATH OpenOpenAlexFDO

Authors Hyun Kwang Kim, Phan Thanh Toan

Publication date 8 June 2017

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

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

Mathematics Subject Classification ID

Semidefinite programming (90C22) Combinatorial codes (94B25) Bounds on codes (94B65) Arithmetic codes (94B40)

Abstract: Let $A(n,d)$ (respectively $A(n,d,w)$) be the maximum possible number of codewords in a binary code (respectively binary constant-weight $w$ code) of length $n$ and minimum Hamming distance at least $d$. By adding new linear constraints to Schrijver's semidefinite programming bound, which is obtained from block-diagonalising the Terwilliger algebra of the Hamming cube, we obtain two new upper bounds on $A(n,d)$, namely $A(18,8)leq71$ and $A(19,8)leq131$. Twenty three new upper bounds on $A(n,d,w)$ for $nleq28$ are also obtained by a similar way.

Cited in

(10)

• New inequalities for q-ary constant-weight codes
• The sextuply shortened binary Golay code is optimal
• New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
• Semidefinite programming bounds for binary codes from a split Terwilliger algebra
• Corrected mean-field model for random sequential adsorption on random geometric graphs
• On the size of maximal binary codes with 2, 3, and 4 distances
• Improved Bit-Stuffing Bounds on Two-Dimensional Constraints
• Improved linear programming bound on sizes of doubly constant-weight codes
• Improved upper bounds on sizes of codes
• A simple proof of the improved Johnson bound for binary codes

This page was built for publication: Improved Semidefinite Programming Bound on Sizes of Codes

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