Strengthened semidefinite programming bounds for codes (Q868466): Difference between revisions

This article studies the problem of computing the maximum size of a binary code of a word of length \(n\) and minimum distance of at least \(m\). The author presents a hierarchy of semidefinite upper bounds for the maximum size and existing known bounds are positioned in the various levels of this hierarchy. In the first section the relevant background and necessary definitions and notation are outlined. This is followed in the second section with a series of theorems on invariant matrices and the \(*\)-representation of a matrix. Results relating to the block-diagonalization of the Terwilliger algebra are also included. The third section presents the main contribution of this paper where the hierarchy of upper bounds is defined and improvements to current bounds are derived. Several theorems and lemmas are presented with proof, as well as computational results highlighting the improved bounds. The article concludes with a list of relevant references.