New upper bounds on the size of codes correcting asymmetric errors.
Jacobus H. WeberCornelis de VroedtDick E. BoekeePublished in: IEEE Trans. Inf. Theory (1987)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- worst case
- upper bounding
- lower and upper bounds
- branch and bound
- error correction
- computational complexity
- active learning
- sample complexity
- branch and bound algorithm
- linear functions
- error detection
- tight bounds
- standard deviation
- efficiently computable
- tight upper and lower bounds
- space complexity
- machine learning
- sufficient conditions
- np hard
- search algorithm
- optimal solution