On the nonexistence of unknown perfect 6- and 8-codes in Hamming schemes H(n,q) with q arbitrary
From MaRDI portal
Publication:800889
zbMath0551.94011MaRDI QIDQ800889
Publication date: 1984
Published in: Osaka Journal of Mathematics (Search for Journal in Brave)
Related Items
Upper bounds for the cardinality of s-distances codes ⋮ 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\) ⋮ Distance-regular graphs of Hamming type ⋮ Alphabet-almost-simple 2-neighbour-transitive codes ⋮ The non-existence of some perfect codes over non-prime power alphabets
