Volume 17, No 3, 2010, P. 84-100

UDC 519.8
F. I. Solov’eva and G. K. Guskov
On construction of vertex-transitive partitions of n-cube into perfect codes

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.

Solov’eva Faina Ivanovna ^1,2
Guskov Georgii Konstantinovich ^1,2
1. S. L. Sobolev Institute of Mathematics, SB RAS,
4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
2. Novosibirsk State University,
2 Pirogov St., 630090 Novosibirsk, Russia
e-mail: sol@math.nsc.ru, m1lesnsk@gmail.com