Acheter 10 livres pour 10 € ici !
Bookbot

Semidefinite programming, binary codes and a graph coloring problem

Auteurs

Paramètres

  • 88pages
  • 4 heures de lecture

En savoir plus sur le livre

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.

Achat du livre

Semidefinite programming, binary codes and a graph coloring problem, Chao Li

Langue
Année de publication
2015
product-detail.submit-box.info.binding
(souple)
Nous vous informerons par e-mail dès que nous l’aurons retrouvé.

Modes de paiement

Personne n'a encore évalué .Évaluer