• Title: NONEXISTENCE THEOREMS FOR PERFECT CODES OVER FINITE FIELDS
  • Description: 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 account 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.
  • Start Date: Feb. 13, 2012
  • Finished Date: May 31, 2012
  • Supervisor: Kjell Elfström
  • Student: André Jönsson

Questions: webmaster
Last update: 2013-04-11

Centre for Mathematical Sciences, Box 118, SE-22100, Lund. Telefon: +46 46-222 00 00 (vx)