Course - Coding Theory - TMA4185
TMA4185 - Coding Theory
About
Examination arrangement
Examination arrangement: Written examination
Grade: Letters
| Evaluation | Weighting | Duration | Grade deviation | Examination aids |
|---|---|---|---|---|
| Written examination | 100/100 | 4 timer |
Course content
Error-correcting codes, Hamming distance, detecting/correcting errors, erasures. Linear block codes, sphere packings and minimal distances, Varshamov and Gilbert existence theorems. Finite fields and polynomials. Berlekamp-Massey algorithm. General BCH codes and Reed-Solomon codes: constructions, properties and decoding algorithms. Cyclic codes. Binary Golay codes: construction and decoding. Introduction to coding with matrices, cross-interleaving and coding of the compact disc.
Learning outcome
This course gives an introduction to the basic algebraic theory for error-correcting codes.
Learning methods and activities
Lectures and exercises. Retake of examination may be given as an oral examination.
Recommended previous knowledge
The course is based on TMA4150 Algebra and Number Theory or MA2201 Algebra.
Course materials
Will be announced at the start of the course.
Credit reductions
| Course code | Reduction | From | To |
|---|---|---|---|
| SIF5032 | 7.5 |
No
Version: 1
Credits:
7.5 SP
Study level: Second degree level
Term no.: 1
Teaching semester: SPRING 2011
Language of instruction: -
-
- Mathematics
- Technological subjects
Department with academic responsibility
Department of Mathematical Sciences
Examination
Examination arrangement: Written examination
- Term Status code Evaluation Weighting Examination aids Date Time Examination system Room *
- Spring ORD Written examination 100/100 2011-05-24 09:00
-
Room Building Number of candidates
- * The location (room) for a written examination is published 3 days before examination date. If more than one room is listed, you will find your room at Studentweb.
For more information regarding registration for examination and examination procedures, see "Innsida - Exams"