On transitive partitions of an <Emphasis Type="Italic">n</Emphasis>-cube into codes |
| |
| Authors: | F I Solov’eva |
| |
| Affiliation: | (1) Sobolev Institute of Mathematics, Siberian Branch of the RAS, Novosibirsk, Novosibirsk State University, Novosibirsk, Russia |
| |
| 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 = 2 k ? 1, k ≥ 3, there exist transitive partitions of E n into perfect transitive codes of length n. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
