Nonexistence Theorems for Perfect Codes over Finite Fields
In this survey, we consider the trivial perfect codes which are the binary repetition codes of odd length and all codes that only contain one code word. We also take into acount, the Hamming codes as well as the two perfect Golay codes. We then prove that there do not exist any perfect codes over finite fields others than the ones above, using Lloyd's theorem.