Abstract:
Metrically regular subsets of the Boolean cube are studied. It is proved that the metrically regular sets of maximal cardinality have covering radius 1 and are the complements of minimal covering codes of radius 1. A lower bound of the sum of cardinalities of two metrically regular sets, each being the metric complement of the other, is obtained. We conjecture that any minimal covering code is a metrically regular set.