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-3MaRDI QIDQ5957760zbMATHWikidataFDO

Authors Roberto Canogar

Publication date 4 November 2002

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

partition designbinary Hamming graphBest code

Mathematics Subject Classification ID

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

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; zbMATH DE number 6497232
• Codes, cubes, and graphical designs

Cited in

(3)

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

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)