F. I. Solov'eva, “On transitive partitions of an <nobr>$n$</nobr>-cube into codes”, Probl. Peredachi Inf., 2009, Volume 45, Issue 1,Pages <nobr>27

This article is cited in 6 papers

Coding Theory

On transitive partitions of an $n$-cube into codes

F. I. Solov'eva^ab

^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$.

UDC: 621.391.15:514

Received: 18.01.2008
Revised: 26.09.2008