This article is cited in 2 papers

On construction of vertex-transitive partitions of $n$-cube into perfect codes

F. I. Solov'eva^ab, G. K. Guskov<sup>ab

a</sup> S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia
^b Novosibirsk State University, Novosibirsk, Russia

Abstract: Two approaches to construct vertex-transitive and 2-transitive partitions of $n$-cube into perfect codes are introduced along with the lower bounds on the number of inequivalent transitive, vertex-transitive and 2-transitive partitions of $n$-cube into perfect codes. Bibl. 16.

Keywords: perfect binary code, vertex-transitive partition, $k$-transitive partition of $n$-cube.

UDC: 519.8

Received: 11.02.2010
Revised: 10.03.2010

Bibliographic databases:

• 
•