No label defined (Q4664649)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2154100
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2154100 |
Statements
8 April 2005
0 references
concatenation construction
0 references
intersection matrix given by partitions into perfect codes
0 references
Latin square
0 references
0.9109061
0 references
0.8801227
0 references
0 references
0 references
0.87573415
0 references
0.8720746
0 references
0.87158203
0 references
0 references
0.8663423
0 references
0.8662392
0 references
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].
0 references