Coding Theory

The course gives an introduction to algebraic coding theory for linear block codes, cyclic codes and convolution codes, as well as to the underlying mathematics. Topics covered include: Bounds for coding parameters; properties, coding and decoding of Hamming codes; Reed-Muller codes; BCH codes and Reed-Solomon codes; Berlekamp-Massey algorithm and Viterbi algorithm for decoding. Finite fields. Linear algebra over finite fields. Rings of power series.

1. Knowledge. The student has knowledge of properties of and algorithms for coding and decoding of linear block codes, cyclic codes and convolution codes. The student has an overview of arithmetic in finite fields, linear algebra over finite fields, and rings of power series. 2. Skills. The student masters arithmetic in finite fields and linear algebra over finite fields. The student is able to apply various algorithms and techniques for coding and decoding.

Lectures and exercises. Retake of examination may be given as an oral examination. The lectures may be given in English. If the course is taught in English, the exam will be given only in English. Students are free to choose Norwegian or English for written assessments. The course will be given in spring in years of odd numbers.