Abstract:

The methods to construct transitive partitions of the $n$-cube into binary codes are presented. The existence of transitive partitions of the $n$-cube, $n=2^k-1$, $k>2$ into perfect binary codes is shown.