Linear inequalities for covering codes. II. Triple covering inequalities

For Pt.I, see ibid., vol.37, no.3, p.573-82 (May 1991). The linear inequality method for covering codes is generalized. This method reduces the study of covering codes to the study of some local covering problems. One of these problems, the 1-3 covering system, is formulated and studied in detail. The results for this local covering problem lead to new linear inequalities satisfied by covering codes, which are used to obtain numerous new lower bounds on K(n, R) and t(n, k).<
>