Bounds for short covering codes and reactive tabu search
Discrete Applied Mathematics
| Hi-index | 754.84 |
New methods for constructing q-ary covering codes are presented. The author introduces the concepts of (p-) seminormal and strongly (p-) seminormal codes and shows how seminormal codes and punctured Hamming codes can be combined to construct new covering codes. Using these methods, upper bounds for ternary covering codes are improved. The new bounds are K3