MAT-51206 CODING THEORY, 6 cr
|
Courses persons responsible
Stephane Foldes
Implementations
Period 1 | Period 2 | Period 3 | Period 4 | Period 5 | Summer | |
Lecture | - | - | - | 4 h/week | 4 h/week | - |
Exercise | - | - | - | 2 h/week | 2 h/week | - |
Exam |
Content
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. |   | |
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.
Evaluation criteria for the course
Study material
Type | Name | Auhor | ISBN | URL | Edition, availability... | Exam material | Language |
Book | Introduction to Coding and Information Theory | Steven Roman | Springer | Yes | English |
Prerequisites
Code | Course | Credits | M/R |
MAT-21160 | MAT-21160 Mathematics for Algorithms | 3 | Mandatory |
MAT-31090 | MAT-31090 Matrix Algebra 1 | 5 | Recommendable |
MAT-41156 | MAT-41156 Algebra 1 | 5 | Mandatory |
MAT-55406 | MAT-55406 Finite Fields | 4 | Recommendable |
Prequisite relations (Sign up to TUT Intranet required)
Remarks
The course is given biannually.
Correspondence of content
73120 Coding Theory
Last modified | 30.01.2006 |
Modified by | Emilia Ylirinne |