New upper bounds for binary covering codes.
Patric R. J. ÖstergårdMarkku K. KaikkonenPublished in: Discret. Math. (1998)
Keyphrases
- upper bound
- lower bound
- logical operations
- upper and lower bounds
- error correcting
- error correcting codes
- worst case
- error correction
- tight bounds
- lower and upper bounds
- branch and bound algorithm
- branch and bound
- binary codes
- sample size
- upper bounding
- tight upper and lower bounds
- iris code
- efficiently computable
- genetic algorithm
- error detection
- binary classifiers
- sample complexity
- generalization error
- computational complexity