Semidefinite Programming Bounds for Constant-Weight Codes

DOI10.1109/TIT.2018.2854800zbMath1431.94167arXiv1703.05171WikidataQ129529383 ScholiaQ129529383MaRDI QIDQ4611411

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)

Related Items (5)

Semidefinite programming bounds for binary codes from a split Terwilliger algebra ⋮ Uniqueness of codes using semidefinite programming ⋮ Improved linear programming bound on sizes of doubly constant-weight codes ⋮ Semidefinite programming bounds for Lee codes ⋮ Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory

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