Semidefinite programming, binary codes and a graph coloring problem

by Chao Li

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...

• 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"