Semidefinite programming, binary codes and a graph coloring problem
8 Angebote vergleichen

Lieferung aus: Schweiz, Versandfertig innert 4 - 7 Werktagen.
Experts in information theory have long been interested in the maximal size A(n,d) of a binary error-correcting code of length n and distance d, The problem of determining A(n,d) involves both the construction of good codes and the search for good upper bounds. From 1973 to 2003, the linear programming bound found many applications, but there were few significant theoretical advances until Schrijver proposed a new code upper bound via semidefinite programming. Using the Terwilliger algebra, Schrijver formulated a new SDP strengthening of the LP approach. In this book we study the dual solutions of the semidefinite program bound, and explore the combinatorial meaning of these variables for small n and d. To obtain information like this, we wrote a program with both MATLAB and CVX modules to get solution of our primal SDP formulation. Our program efficiently generates the primal solutions with corresponding constraints for any n and d. We also wrote programs to parse the optimal solutions of the primal SDP and obtain the optimal solutions of the dual problem automatically. These values are very useful for later study of the combinatorial meaning of such solutions. Taschenbuch, 07.10.2015.

Lieferung aus: Deutschland, Versandkostenfrei.
Von Händler/Antiquariat, AHA-BUCH GmbH [51283250], Einbeck, Germany.
This item is printed on demand - Print on Demand Neuware - Experts in information theory have long been interested in the maximal size A(n,d) of a binary error-correcting code of length n and distance d, The problem of determining A(n,d) involves both the construction of good codes and the search for good upper bounds. From 1973 to 2003, the linear programming bound found many applications, but there were few significant theoretical advances until Schrijver proposed a new code upper bound via semidefinite programming. Using the Terwilliger algebra, Schrijver formulated a new SDP strengthening of the LP approach. In this book we study the dual solutions of the semidefinite program bound, and explore the combinatorial meaning of these variables for small n and d. To obtain information like this, we wrote a program with both MATLAB and CVX modules to get solution of our primal SDP formulation. Our program efficiently generates the primal solutions with corresponding constraints for any n and d. We also wrote programs to parse the optimal solutions of the primal SDP and obtain the optimal solutions of the dual problem automatically. These values are very useful for later study of the combinatorial meaning of such solutions. 88 pp. Englisch.

Lieferung aus: Deutschland, Lieferzeit: 5 Tage.
Experts in information theory have long been interested in the maximal size A(n,d) of a binary error-correcting code of length n and distance d, The problem of determining A(n,d) involves both the construction of good codes and the search for good upper bounds. From 1973 to 2003, the linear programming bound found many applications, but there were few significant theoretical advances until Schrijver proposed a new code upper bound via semidefinite programming. Using the Terwilliger algebra, Schrijver formulated a new SDP strengthening of the LP approach. In this book we study the dual solutions of the semidefinite program bound, and explore the combinatorial meaning of these variables for small n and d. To obtain information like this, we wrote a program with both MATLAB and CVX modules to get solution of our primal SDP formulation. Our program efficiently generates the primal solutions with corresponding constraints for any n and d. We also wrote programs to parse the optimal solutions of the primal SDP and obtain the optimal solutions of the dual problem automatically. These values are very useful for later study of the combinatorial meaning of such solutions.

Lieferung aus: Deutschland, Versandkostenfrei.
Semidefinite programming, binary codes and a graph coloring problem: Experts in information theory have long been interested in the maximal size A(n,d) of a binary error-correcting code of length n and distance d, The problem of determining A(n,d) involves both the construction of good codes and the search for good upper bounds. From 1973 to 2003, the linear programming bound found many applications, but there were few significant theoretical advances until Schrijver proposed a new code upper bound via semidefinite programming. Using the Terwilliger algebra, Schrijver formulated a new SDP strengthening of the LP approach. In this book we study the dual solutions of the semidefinite program bound, and explore the combinatorial meaning of these variables for small n and d. To obtain information like this, we wrote a program with both MATLAB and CVX modules to get solution of our primal SDP formulation. Our program efficiently generates the primal solutions with corresponding constraints for any n and d. We also wrote programs to parse the optimal solutions of the primal SDP and obtain the optimal solutions of the dual problem automatically. These values are very useful for later study of the combinatorial meaning of such solutions. Englisch, Taschenbuch.

Von Händler/Antiquariat, Books2Anywhere [190245], Fairford, GLOS, United Kingdom.
New Book. Delivered from our UK warehouse in 3 to 5 business days.THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

Lieferung aus: Deutschland, Versandkostenfrei.
Von Händler/Antiquariat, English-Book-Service Mannheim [1048135], Mannheim, Germany.
This item is printed on demand for shipment within 3 working days.

Lieferung aus: Deutschland, Next Day, Versandkostenfrei.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen