Semidefinite programming, binary codes and a graph coloring problem
No Customer Reviews
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 solution
Format:Paperback
Language:English
ISBN:3659764264
ISBN13:9783659764264
Release Date:September 2015
Publisher:LAP Lambert Academic Publishing
Length:88 Pages
Weight:0.31 lbs.
Dimensions:0.2" x 6.0" x 9.0"
Customer Reviews
0 rating
Copyright © 2025 Thriftbooks.com
Terms of Use | Privacy Policy | Do Not Sell/Share My Personal Information | Cookie Policy | Cookie Preferences | Accessibility Statement
ThriftBooks ® and the ThriftBooks ® logo are registered trademarks of Thrift Books Global, LLC
ThriftBooks ® and the ThriftBooks ® logo are registered trademarks of Thrift Books Global, LLC
