New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming.
Dion GijswijtAlexander SchrijverHajime TanakaPublished in: J. Comb. Theory, Ser. A (2006)
Keyphrases
- semidefinite programming
- upper bound
- non binary
- lower bound
- constraint satisfaction problems
- linear programming
- maximum margin
- kernel matrix
- arc consistency
- worst case
- primal dual
- sample size
- generalization error
- data sets
- frequent pattern mining
- constraint satisfaction
- constraint propagation
- np hard
- objective function
- generative model
- nearest neighbor
- training data