Further results on (k, t)-subnormal covering codes
Patric R. J. Östergård · IEEE Transactions on Information Theory · 1992
The concept of (k, t)-subnormal covering codes, is discussed generalizing some of the earlier results. In a similar way, (k, t)-normal covering codes are defined. Using the results, including some new constructions, upper bounds for covering codes are improved. It is shown how simulated annealing can be used to find acceptable partitions for codes.>