Let Fn be the n-dimensional vector space over Z2. A (binary) 1-perfect partition of Fn is a partition of Fn into (binary) perfect single error-correcting codes or 1-perfect codes. We define two metric properties for 1-perfect partitions: uniformity and distance invariance. Then we prove the equivalence between these properties and algebraic properties of the code (the class containing the zero vector). In this way, we characterize 1-perfect partitions obtained using 1-perfect translation invariant and not translation invariant propelinear codes. The search for examples of 1-perfect uniform but not distance invariant partitions enabled us to deduce a non-Abelian propelinear group structure for any Hamming code of length greater than 7.
|Journal||Applicable Algebra in Engineering, Communications and Computing|
|Publication status||Published - 1 Jan 2001|
- Perfect distance invariant partitions
- Perfect propelinear codes
- Perfect uniform partitions