On the nonexistence of unknown perfect 6- and 8-codes in Hamming schemes H(n,q) with q arbitrary

In the Hamming schemes H(n,q) we know perfect e-codes for \(e\geq 2\), namely the trivial ones and the Golay codes. There are many papers concerning the nonexistence of perfect e-codes in H(n,q). The major results are the following ones. No unknown perfect e-code exists when: 1) \(q=p^ s\), p prime, \(e\geq 2\); 2) \(q=p^ s_ 1p^ t_ 2\), \(e\geq 3\); 3) \(q=p^ a_ 1p^ b_ 2p^ c_ 3\), \(e\geq 3\); 4) \(e=3\), 4, 5; 5) \(e=7\), \(e\geq 9\). (For the cases 1)- 4) see the review of \textit{H. Laakso's} paper [Ann. Univ. Turku., Ser A I 177 (1979; Zbl 0407.94011)] and the works cited there, for case 5) see \textit{M. R. Best's} A contribution to the nonexistence of perfect codes (1983; Zbl 0526.94014).) In this paper the author proves the nonexistence of perfect e-codes for \(e=6\) or 8 and \(q\geq 30\). Hence the nonexistence of unknown perfect e- codes is settled for \(e\geq 3\) with q arbitrary.

Recommendations

Cited in

(11)

This page was built for publication: On the nonexistence of unknown perfect 6- and 8-codes in Hamming schemes H(n,q) with q arbitrary

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800889)