Constructions for perfect mixed codes and other covering codes
Tuvi Etzion, Gabriel Greenberg · IEEE Transactions on Information Theory · 1993
A construction for an infinite family of perfect mixed codes with covering radius 2 is presented. These are the first known nontrivial perfect mixed codes with covering radius greater than 1. Based on mixed codes, constructions for binary covering codes that lead to a considerable improvement of upper bounds on the sizes of covering codes are presented. These codes and some other codes can be obtained by the blockwise direct sum construction. Two infinite families of codes are of special interest. They are quasi-perfect, nonlinear, union of their disjoint translates covers the space, and their density as covering codes is remarkably low.>