Abstract:
Using variations of the generalized concatenation of appropriately chosen codes, we give new constructions of binary nonlinear perfect codes with minimum distance 3 and lower bound the number of different codes obtained by these constructions.