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 minimum distance d, The problem of determining A(n, d) involves both the construction of good codes and the search for good upper bounds. For quite some time...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
Digital WPI
2015
|
| Subjects: | |
| Online Access: | https://digitalcommons.wpi.edu/etd-theses/863 https://digitalcommons.wpi.edu/cgi/viewcontent.cgi?article=1862&context=etd-theses |