Semidefinite Programming Bounds for Constant-Weight Codes
From MaRDI portal
Publication:4611411
DOI10.1109/TIT.2018.2854800zbMath1431.94167arXiv1703.05171MaRDI QIDQ4611411
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
Related Items
Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory, Semidefinite programming bounds for binary codes from a split Terwilliger algebra, Improved linear programming bound on sizes of doubly constant-weight codes, Uniqueness of codes using semidefinite programming, Semidefinite programming bounds for Lee codes