Intersection matrices for partitions by binary perfect codes

DOI10.1109/18.923749zbMATH Open1017.94019OpenAlexW2097362347MaRDI QIDQ4544601FDOQ4544601

Authors: Sergey Avgustinovich, Antoine 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

Recommendations

• scientific article; zbMATH DE number 2154100
• scientific article; zbMATH DE number 5054189
• On intersection problem for perfect binary codes
• Intersections of \(q\)-ary perfect codes
• scientific article; zbMATH DE number 503208

zbMATH Keywords

partitionsintersection matrixconcatenated codesextended perfect codesstrongly orthogonal Latin squares

Mathematics Subject Classification ID

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

Cited In (13)

• On intersection problem for perfect binary codes
• Partitions into perfect codes in the Hamming and Lee metrics
• On transitive partitions of an \(n\)-cube into codes
• On partitions of an \(n\)-cube into nonequivalent perfect codes
• Title not available (Why is that?)
• Partition designs with two subsets of the Hamming space
• Linear maps of perfect codes and irregular \(C\)-partitions
• Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes
• On perfect binary codes
• On \(r\)-partition designs in Hamming spaces
• Intersections of \(q\)-ary perfect codes
• Title not available (Why is that?)
• A partition of the hypercube into maximally nonparallel Hamming codes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544601)