We derive lower bounds onR-coverings and upper bounds one-packings of . These bounds are generalizations of the bounds for the cases R = 1, e = 1 or t = 0 or b = 0, which were already derived in a paper by the second-named author. The present work is a supplement to that paper. The computed results for t + b = 13 and R, e = 3 are collected in a table.
van Lint, J. H., & Wee, van, G. J. M. (1991). Generalized bounds on binary/ternary mixed packing and covering codes. Journal of Combinatorial Theory, Series A, 57(1), 130-143. https://doi.org/10.1016/0097-3165(91)90011-5