Semidefinite bounds for nonbinary codes based on quadruples.
Bart LitjensSven C. PolakAlexander SchrijverPublished in: Des. Codes Cryptogr. (2017)
Keyphrases
- semidefinite
- non binary
- semidefinite programming
- constraint satisfaction problems
- upper bound
- lower bound
- interior point methods
- sufficient conditions
- convex relaxation
- higher dimensional
- worst case
- convex sets
- linear programming
- frequent pattern mining
- arc consistency
- constraint propagation
- convex optimization
- frequent patterns
- image classification
- search space