scientific article; zbMATH DE number 2154100
Exploiting some concatenation constructions, lower and upper bounds are presented for the number of intersection matrices given by different partitions of the \(n\)-dimensional metric space \(E^n\) over the Galois field \(\text{GF}(2)\) with the Hamming metric on perfect binary codes. The following problem is considered: given two partitions of \(E^n\) into perfect codes, their intersection matrix provides the cardinalities of the pairwise intersections of the subsets of these partitions. It is proven that the number of different, or nonequivalent, intersection matrices given by partitions of extended perfect binary codes of length \(n\) is at least \(2^{cn^2}\) and at most \(2^{c'n^3}\), where~\(n\) is large and \(c, c'\) are positive constants. For the entire collection see [Zbl 0944.00096].
- On partitions of an n-cube into perfect binary codes
- Partitions into perfect codes in the Hamming and Lee metrics
- Partitions in finite geometry and related constant composition codes
- Perfect binary space partitions
- On partitions of an n-cube into nonequivalent perfect codes
- Intersection matrices for partitions by binary perfect codes
- Constructions of partitions of F_q^N into perfect q-ary codes
- Coding partitions of regular sets
- Perfect codes and regular partitions in graphs and groups
- Indivisible partitions of Latin squares
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4664649)