Intersection matrices for partitions by binary perfect codes
We investigate the Following problem: given two partitions of the Hamming space, their intersection matrix provides the cardinalities of the pairwise intersections of the subsets of these partitions. If we consider partitions by extended perfect codes, how many intersection matrices can we construct?
intersection matrices partitions extended perfect codes concatenated codes strongly orthogonal latin squares