S. V. Avgustinovich, F. I. Solov'eva, O. Heden, “Partitions of an <nobr>$n$</nobr>-Cube into Nonequivalent Perfect Codes”, Probl. Peredachi Inf., 2007, Volume 43, Issue 4,Pages <nobr>45

This article is cited in 13 papers

Coding Theory

Partitions of an $n$-Cube into Nonequivalent Perfect Codes

S. V. Avgustinovich^ab, F. I. Solov'eva^ab, O. Heden^c

^a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
^b Novosibirsk State University
^c Royal Institute of Technology

Abstract: We prove that for all $n=2^k-1$, $k\ge5$, there exists a partition of the set of all binary vectors of length $n$ into pairwise nonequivalent perfect binary codes of length $n$ with distance 3.

UDC: 621.391.15

Received: 09.04.2007
Revised: 13.09.2007