An example related to the Best code of reconstructing the cells of a partition design from its adjacency matrix (Q5957760)

First, a description of how eight copies of the Best code can be embedded in the binary Hamming graph of length 10 in such a way that they form part of a partition design \(\pi_1\) is given. The author studies those isometries of the binary Hamming graph that stabilize \(\pi_1\). Then a partition design \(\pi_2\) that is coarser than \(\pi_1\) is considered. Let \(M\) be the adjacency matrix of \(\pi_2\). It is shown that this \(M\) is extreme in some sense. That is \(\pi_2\) has an interesting property; namely, \(\pi_2\) is the unique partition design with adjacency matrix \(M\).