Characterizing imprimitive partition designs of binary Hamming graphs
From MaRDI portal
Publication:1827338
DOI10.1016/j.ejc.2003.11.001zbMath1053.05021OpenAlexW2083881167MaRDI QIDQ1827338
Publication date: 6 August 2004
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2003.11.001
Cites Work
- Unnamed Item
- Unnamed Item
- On \(r\)-partition designs in Hamming spaces
- Problems in algebraic combinatorics
- Distance-regularised graphs are distance-regular or distance-biregular
- Completely regular designs
- An example related to the Best code of reconstructing the cells of a partition design from its adjacency matrix
This page was built for publication: Characterizing imprimitive partition designs of binary Hamming graphs