Intersection matrices for partitions by binary perfect codes

DOI10.1109/18.923749zbMath1017.94019OpenAlexW2097362347MaRDI QIDQ4544601

Sergei V. Avgustinovich, Antoine C. Lobstein, Faina I. Solov'eva

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.923749

zbMATH Keywords

partitionsintersection matrixconcatenated codesextended perfect codesstrongly orthogonal Latin squares

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Cyclic codes (94B15)

Related Items (7)

Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes ⋮ Partitions into perfect codes in the Hamming and Lee metrics ⋮ On partitions of an \(n\)-cube into nonequivalent perfect codes ⋮ On perfect binary codes ⋮ A Partition of the Hypercube into Maximally Nonparallel Hamming Codes ⋮ On intersection problem for perfect binary codes ⋮ On transitive partitions of an \(n\)-cube into codes

This page was built for publication: Intersection matrices for partitions by binary perfect codes