The principal result is a construction of completely regular semigroups in terms of semilattices of Rees matrix semigroups and their translational hulls. The main body of the paper is occupied by considerations of various special cases based on the behavior of either Green's relations or idempotents. The influence of these special cases on the construction in question is studied in considerable...

Binary non-antipodal completely regular codes are characterized. Using the result on nonexistence of nontrivial binary perfect codes, it is concluded that there are no unknown nontrivial non-antipodal completely regular binary codes with minimum distance d ≥ 3. The only such codes are halves and punctered halves of known binary perfect codes. Thus, new such codes with covering radiuses ρ = 2, 3...

We study a class of highly regular t-designs. These are the subsets of vertices of the Johnson graph which are completely regular in the sense of Delsarte [2]. In [9], Meyerowitz classified the completely regular designs having strength zero. In this paper, we determine the completely regular designs having strength one and minimum distance at least two. The approach taken here utilizes the inc...