An example related to the Best code of reconstructing the cells of a partition design from its adjacency matrix

DOI10.1016/S0012-365X(01)00319-3zbMATH Open0996.94052WikidataQ126648949 ScholiaQ126648949MaRDI QIDQ5957760FDOQ5957760

Authors: Roberto Canogar 

Publication date: 4 November 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• Partition designs with two subsets of the Hamming space
• On \(r\)-partition designs in Hamming spaces
• Characterizing imprimitive partition designs of binary Hamming graphs
• scientific article
• Codes, cubes, and graphical designs

zbMATH Keywords

partition designbinary Hamming graphBest code

Mathematics Subject Classification ID

Other designs, configurations (05B30) Other types of codes (94B60)

Cited In (3)

• Partition designs with two subsets of the Hamming space
• On \(r\)-partition designs in Hamming spaces
• Characterizing imprimitive partition designs of binary Hamming graphs

This page was built for publication: An example related to the Best code of reconstructing the cells of a partition design from its adjacency matrix

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