Some new lower bounds for binary and ternary covering codes.
Gerhard J. M. van WeePublished in: IEEE Trans. Inf. Theory (1993)
Keyphrases
- lower bound
- upper bound
- logical operations
- error correcting
- error correcting codes
- optimal solution
- branch and bound
- branch and bound algorithm
- error correction
- objective function
- lower and upper bounds
- upper and lower bounds
- binary codes
- worst case
- lower bounding
- hamming distance
- randomly generated problems
- minimum volume
- optimal cost
- data sets
- quadratic assignment problem
- non binary
- np hard
- search algorithm
- genetic algorithm