New lower bounds for binary covering codes.
Dongfeng LiWende ChenPublished in: IEEE Trans. Inf. Theory (1994)
Keyphrases
- lower bound
- upper bound
- logical operations
- branch and bound
- error correcting
- branch and bound algorithm
- error correcting codes
- worst case
- objective function
- quadratic assignment problem
- lower and upper bounds
- binary codes
- np hard
- error control
- upper and lower bounds
- sample size
- gray code
- randomly generated problems
- non binary
- online algorithms
- lower bounding
- optimal solution
- data sets
- query processing
- sample complexity
- error correction
- linear programming
- online learning