Title :
Intersection matrices for partitions by binary perfect codes
Author :
Avgustinovich, Sergey V. ; Lobstein, Antoine C. ; Solov´eva, Faina I.
Author_Institution :
Sobolev Inst. of Math., Novosibirsk, Russia
fDate :
5/1/2001 12:00:00 AM
Abstract :
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?
Keywords :
binary codes; concatenated codes; matrix algebra; Hamming space; Latin squares; binary perfect codes; cardinalities; concatenation; extended perfect codes; intersection matrices; pairwise intersections; partitions; Buildings; Codes; Mathematics;
Journal_Title :
Information Theory, IEEE Transactions on
