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\) (Q1078149)

The author proves the known result of the nonexistence of unknown perfect e-codes and the new result of the nonexistence of unknown tight 2e- designs in the Hamming schemes H(n,q) for \(e\geq 3\) and \(q\geq 3\). The nonexistence of perfect codes is proved by using only Lloyd's theorem (not the sphere packing condition). This paper is basically a summary of the author's Ph. D. dissertation [On the nonexistence of perfect e-codes and tight 2e-designs in Hamming schemes h(n,q) with \(e\geq 3\) and \(q\geq 3\). Ph. D. dissertation, Ohio State University (1984)].