Semidefinite programming, binary codes and a graph coloring problem

Meer over het boek

Focusing on the advancements in binary error-correcting codes, the book delves into the maximal size A(n,d) and the development of upper bounds through semidefinite programming (SDP). It highlights the application of Schrijver's new upper bound and the use of the Terwilliger algebra. The authors detail their innovative programming approach using MATLAB and CVX to efficiently generate and analyze primal and dual solutions for various values of n and d, providing valuable insights into the combinatorial implications of these findings.