|
Diskretnyi Analiz i Issledovanie Operatsii, 2010, Volume 17, Issue 3, Pages 84–100
(Mi da613)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
On construction of vertex-transitive partitions of $n$-cube into perfect codes
F. I. Solov'evaab, G. K. Guskovab a 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.
Received: 11.02.2010 Revised: 10.03.2010
Citation:
F. I. Solov'eva, G. K. Guskov, “On construction of vertex-transitive partitions of $n$-cube into perfect codes”, Diskretn. Anal. Issled. Oper., 17:3 (2010), 84–100
Linking options:
https://www.mathnet.ru/eng/da613 https://www.mathnet.ru/eng/da/v17/i3/p84
|
Statistics & downloads: |
Abstract page: | 400 | Full-text PDF : | 118 | References: | 58 | First page: | 6 |
|