On partitions of an <Emphasis Type="Italic">n</Emphasis>-cube into nonequivalent perfect codes |
| |
| Authors: | S V Avgustinovich F I Solov’eva O Heden |
| |
| Affiliation: | (1) Sobolev Institute of Mathematics, Siberian Branch of the RAS, Novosibirsk State University, Novosibirsk, Russia;(2) Royal Institute of Technology, Stockholm, Sweden |
| |
| Abstract: | We prove that for all n = 2k ? 1, k ≥ 5, 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
