Geodesic
On construction of vertex-transitive partitions of $n$-cube into perfect codes
Diskretnyj analiz i issledovanie operacij, Tome 17 (2010) no. 3, pp. 84-100

Voir la notice de l'article provenant de la source Math-Net.Ru

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, $k$-transitive partition of $n$-cube.
Mots-clés : vertex-transitive partition 
@article{DA_2010_17_3_a5,
     author = {F. I. Solov'eva and G. K. Guskov},
     title = {On construction of vertex-transitive partitions of $n$-cube into perfect codes},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {84--100},
     publisher = {mathdoc},
     volume = {17},
     number = {3},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2010_17_3_a5/}
}
TY  - JOUR
AU  - F. I. Solov'eva
AU  - G. K. Guskov
TI  - On construction of vertex-transitive partitions of $n$-cube into perfect codes
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2010
SP  - 84
EP  - 100
VL  - 17
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2010_17_3_a5/
LA  - ru
ID  - DA_2010_17_3_a5
ER  - 
%0 Journal Article
%A F. I. Solov'eva
%A G. K. Guskov
%T On construction of vertex-transitive partitions of $n$-cube into perfect codes
%J Diskretnyj analiz i issledovanie operacij
%D 2010
%P 84-100
%V 17
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2010_17_3_a5/
%G ru
%F DA_2010_17_3_a5
F. I. Solov'eva; G. K. Guskov. On construction of vertex-transitive partitions of $n$-cube into perfect codes. Diskretnyj analiz i issledovanie operacij, Tome 17 (2010) no. 3, pp. 84-100. http://geodesic.mathdoc.fr/item/DA_2010_17_3_a5/