On new perfect binary nonlinear codes
The paper provides a new construction of binary nonlinear perfect codes with minimum distance 3. The construction is based on concatenation. Moreover, a lower bound on the number of mutually nonequivalent codes that can be constructed this way is provided. In practice, this lower bound is quite rough.
scientific article; zbMATH DE number 1038363