|
Problemy Peredachi Informatsii, 2009, Volume 45, Issue 1, Pages 27–35
(Mi ppi1256)
|
|
|
|
This article is cited in 6 scientific papers (total in 6 papers)
Coding Theory
On transitive partitions of an $n$-cube into codes
F. I. Solov'evaab a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
b Novosibirsk State University
Abstract:
We present methods to construct transitive partitions of the set $E^n$ of all binary vectors of length $n$ into codes. In particular, we show that for all $n=2k-1$, $k\ge 3$, there exist transitive partitions of $E^n$ into perfect transitive codes of length $n$.
Received: 18.01.2008 Revised: 26.09.2008
Citation:
F. I. Solov'eva, “On transitive partitions of an $n$-cube into codes”, Probl. Peredachi Inf., 45:1 (2009), 27–35; Problems Inform. Transmission, 45:1 (2009), 23–31
Linking options:
https://www.mathnet.ru/eng/ppi1256 https://www.mathnet.ru/eng/ppi/v45/i1/p27
|
Statistics & downloads: |
Abstract page: | 392 | Full-text PDF : | 96 | References: | 63 | First page: | 4 |
|