Linear programming bounds for codes via a covering argument.
Michael NavonAlex SamorodnitskyPublished in: Electron. Colloquium Comput. Complex. (2007)
Keyphrases
- linear programming
- linear program
- lower bound
- upper bound
- error correction
- feasible solution
- objective function
- quadratic programming
- integer programming
- np hard
- upper and lower bounds
- primal dual
- column generation
- nonlinear programming
- confidence bounds
- tight bounds
- optimal solution
- network flow
- algorithm for linear programming
- legal argument
- constraint propagation
- dynamic programming
- worst case
- vc dimension
- data sets
- error bounds
- graphical representation
- search algorithm
- lower and upper bounds
- uniform convergence
- logical operations
- hypothetical reasoning
- minimum volume