On perfect codes in the Hamming schemes H(n,q) with q arbitrary
From MaRDI portal
Publication:1237695
DOI10.1016/0097-3165(77)90079-6zbMath0356.94008OpenAlexW1977730218MaRDI QIDQ1237695
Publication date: 1977
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(77)90079-6
Related Items
On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e\(\geq 3\) and q\(\geq 3\), Cyclotomic graphs and perfect codes, Distance-regular graphs of Hamming type, Total perfect codes in Cayley graphs, On non-normal subgroup perfect codes, Perfect codes in vertex-transitive graphs, Perfect Codes in Cayley Graphs, On subgroup perfect codes in Cayley graphs, On tight spherical designs
Cites Work
