Opinto-opas 2005-2006

MAT-51206 KOODAUSTEORIA, 6 cr
CODING THEORY

Person responsible
Stephan Foldes

Lecturers
Stephan Foldes, professor

Lecture room and time
Per IV,V: Tuesday 14 - 16, TB214
Per IV,V: Tuesday 18 - 19, TB214
Per IV: Wednesday 14 - 15, TB214
Per V: Wednesday 18 - 19, TB214

Implementation rounds
Implementation 1
  Period 1 Period 2 Period 3 Period 4 Period 5 Summer Language of instruction
Lecture - - - 4 h/week+ 4 h/week - In English only
Exercise - - - 2 h/week+ 2 h/week - In English only
Exam   In English only
(Academic Calender 2005-2006)

Contents
Content Core content Complementary knowledge Specialist knowledge
1. Strings and fixed length codes. Minimum distance, error detection, error correction.       
2. Codewords as vectors over a finite field. Binary codes and the 2-element field. Linear codes. Some special codes. Codewords as polynomials over a finite field, cyclic codes.       
3. Codewords as polynomials over a finite field, cyclic codes.       

Requirements for completing the course
Final exam and activity points, particulars to be announced during first lecture.

Assessment criteria

  • Used assessment scale is numeric (1-5)

    • Study material
    Type Name Author ISBN URL, edition, availablitity... Exam material Language
    Book Introduction to Coding and Information Theory Steven Roman   Springer Yes  English 

    Prerequisites
    Number Name Credits M/R
    MAT-21160 Mathematics for Algorithms 3 Mandatory
    MAT-31090 Matrix Algebra 1 5 Recommendable
    MAT-41156 Algebra 1 5 Mandatory
    MAT-55406 Finite Fields 4 Recommendable

    Other comments
    The course is given biannually. It is given in the academic year 2005-2006. Lectures in English.

  • The course is suitable for postgraduate studies.

    • Correspondence of content
    73120 Coding Theory

    Last modified 14.04.2005
    Modified byArto Aho