Improved Semidefinite Programming Bound on Sizes of Codes

DOI10.1109/TIT.2013.2277714zbMath1364.94783arXiv1212.3467OpenAlexW2064539894MaRDI QIDQ5346260

Phan Thanh Toan, Hyun Kwang Kim

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) Bounds on codes (94B65) Combinatorial codes (94B25) Arithmetic codes (94B40)

Related Items (6)

New inequalities for \(q\)-ary constant-weight codes ⋮ Semidefinite programming bounds for binary codes from a split Terwilliger algebra ⋮ A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES ⋮ The sextuply shortened binary Golay code is optimal ⋮ Corrected mean-field model for random sequential adsorption on random geometric graphs ⋮ Improved linear programming bound on sizes of doubly constant-weight codes

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