Construction of Perfect Binary Codes by Sequential Shifts of $\tilde\alpha$-Components

We propose the construction of perfect binary codes by sequential shifts of special-kind components of the Hamming code. The construction yields a new lower estimate on the number of nonequivalent perfect binary codes. Some known constructions of perfect binary codes are particular cases of this one.