On the binary codes with parameters of triply-shortened 1-perfect codes (Q438873)

This paper studies the binary codes with parameters of triply-shortened extended Hamming codes and triply-shortened Hamming codes. More precisely, it discusses the properties of codes \(C\) and \(D\) with parameters \((n=2^m -3, 2^{n-m-1}, 4)\) and \((n=2^m -4, 2^{n-m}, 3)\) respectively. The author proves that \(C\) is a cell of an equitable partition of the \(n\)-cube into six cells and \(D\) is a cell of an equitable family (but not a partition) with six cells. The author gives a general criterion for a partition of the vertices of a graph (from a rather general class of graphs, including the distance-regular graphs) to be equitable, whose usability is not bounded to the current research.