Olof Heden - Department of Mathematics, KTH, Stockholm, Sweden S-100 44, Sweden (email)
The first examples of perfect $e$-error correcting $q$-ary codes were given in the 1940's by Hamming and Golay. In 1973 Tietäväinen, and independently Zinoviev and Leontiev, proved that if q is a power of a prime number then there are no unknown multiple error correcting perfect $q$-ary codes. The
case of single error correcting perfect codes is quite different. The number of different such codes is very large and the classification, enumeration and description of all perfect 1-error correcting codes is still an open problem.
Keywords: Perfect codes.
Received: December 2007; Revised: April 2008; Available Online: April 2008.
2015 Impact Factor.631