Linear Programming Bounds for Codes via a Covering Argument.
Michael NavonAlex SamorodnitskyPublished in: Discret. Comput. Geom. (2009)
Keyphrases
- linear programming
- linear program
- upper bound
- lower bound
- feasible solution
- objective function
- dynamic programming
- integer programming
- upper and lower bounds
- quadratic programming
- np hard
- error correction
- primal dual
- worst case
- optimal solution
- error bounds
- graphical representation
- network flow
- nonlinear programming
- column generation
- average case
- tight bounds
- error correcting codes
- confidence bounds
- worst case bounds
- machine learning
- special case
- lower and upper bounds
- search space
- generalization bounds
- hypothetical reasoning