1-perfect uniform and distance invariant partitions (Q5938531): Difference between revisions

Let \(F^n\) be the \(n\)-dimensional vector space over \(GF(2)\). A binary 1-perfect partition of \(F^n\) is a partition of \(F^n\) into binary perfect single error correcting codes. Every perfect single error correcting code of length \(n\) gives rise to a trivial 1-perfect partition of \(F^n\) by considering the code and its cosets: \(\{C+x \mid wt(x)=0\) or \(wt(x)=1\}\). The authors are interested in non-trivial 1-perfect partitions. They define two metric properties for 1-perfect partitions: uniformity and distance invariance. Then they prove the equivalence between these properties and algebraic properties of the code (the class containing the zero vector). In this way they characterize 1-perfect partitions obtained using 1-perfect translation invariant propelinear codes. The search for examples of 1-perfect uniform but not distance invariant partitions resulted in finding a non-Abelian propelinear group structure for any Hamming code of length greater than 7. Apparently this work is initiated by a question raised by \textit{T. Etzion} and \textit{A. Vardy} [SIAM J. Discrete Math. 11, 205-223 (1998; Zbl 0908.94035)]. From a combinatorial geometric point of view, these results might be interesting, however the coding theoretic impact seems to be very low.