You are being redirected. If it does not work, go to this page.

TMA4185 Coding Theory
Spring 2005


Galois Shannon Hamming

Messages
  • The midterm takes place on Monday, March 7, 13.15-15.00 in F6. Good luck!
  • The exercises on the Problem sheets are also syllabus for the midterm.

Course
description		 Introduction to the theory of error correcting codes: linear codes, perfect codes, cyclic codes, BCH codes, Reed-Solomon codes, burst codes, convolutional codes, finite fields and polynomials.
  • Prerequisite: TMA4150 or MA2201.
  • 7,5 credits - 1 semester (spring).
  • 4 lecturing hours per week.
  • Midterm and final exam (20/80).
Lecturers
First half of the course:
Petter Andreas Bergh
Office: room 502, Sentralbygg 2  
Email: bergh@math.ntnu.no
Phone: (735)90483

 Second half of the course:
Aslak Bakke Buan
Office: room 544, Sentralbygg 2
Email: aslakb@math.ntnu.no
Phone: (735)50289
Textbook and
syllabus		 Hankerson, Hoffman et.al., Coding Theory and Cryptography, 2nd edition.
We will cover approximately the first nine chapters.
Syllabus for the midterm:
  • Chapter 1 (except 1.6 and 1.10)
  • Chapter 2 (except 2.12)
  • Chapter 3 (except 3.9)
  • Chapter 4
  • The Problem sheets.


Midterm and
final exam		 The midterm (20%) takes place on Monday, March 7. The written final exam (80%) takes place on Monday, May 23.
Lectures and
problem session
Lectures: Monday 12.15-14.00 in F6
Thursday 8.15-10.00 in 546
Problem session: Every second Tuesday, 17.15-18.00 in 546
Exercises Problem set 1: pdf  ps (for Tuesday January 18)
Problem set 2: pdf  ps (for Tuesday February 1)
Problem set 3: pdf  ps (for Tuesday February 15)
Problem set 4: pdf  ps