Abstract.
Let F n be the n-dimensional vector space over ℤ2. A (binary) 1-perfect partition of F n is a partition of F n 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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: March 6, 2000; revised version: November 30, 2000
Rights and permissions
About this article
Cite this article
Rifà, J., Pujol, J. & Borges, J. 1-Perfect Uniform and Distance Invariant Partitions. AAECC 11, 297–311 (2001). https://doi.org/10.1007/PL00004224
Issue Date:
DOI: https://doi.org/10.1007/PL00004224