====== Introduction to Coding Theory ======

Lecture notes and exercise sheets can be found [[en:courses:2009-2010:mct_handouts|here]].

This course is an introduction to algebraic coding theory. Topics covered will include

  * Linear algebraic codes
  * First examples: Golay and RM codes
  * Reed-Solomon codes and their (list)-decoding algorithms
  * Efficient decoding: the displacement method
  * Codes from algebraic geometry
  * Codes over rings
  * Expander graphs and expander codes



The course consists of one weekly lecture (90 minutes on Thursdays from 13:15 to 15:00pm, given by Bertrand Meyer) and one weekly exercise session (90 minutes on Thursdays from 15:15 to 17:00pm, given by Ghid Maatouk). The course and the exercises will be in English. Grading is based on the final exam.

**Office hours :** Monday from 3pm to 4pm or on appointment by email (firstname.lastname@epfl.ch). Room BC 128 

===== Recommended reading for this course =====

  * “Theory of Error Correcting Codes,” by F.J. MacWilliams and N. Sloane
  * “Introduction to Coding Theory,” by J.H. van Lint

Other relevant material will be advertised in the class.


===== Grading =====

The mid-term exam will be on 15th April from 1:15pm to 4:15pm. You're allowed to take with you one hand-written note on A4 format (recto verso). No other document or material will be allowed. 

Final exam will be Wed. 30th June from 8:15am to 11:15am in Room CM1113. You're allowed to take with you one hand-written note on A4 format (recto verso). No other document or material will be allowed.

Final grade will be max(F , (F+M)/2 ) where F and M stand for your grade at the final and midterm exam.

{{:en:courses:2009-2010:midterm_10.pdf|Midterm exam}}

{{:en:courses:2009-2010:final_10.pdf|Final exam}}