Course Catalog 2009-2010 |
|||||
| Basic | Pori | International | Postgraduate | Open University | |
|
|
|
|||||||||||||||||
MAT-51206 Coding Theory, 6 cr |
Stephane Foldes
| Lecture times and places | Target group recommended to | |
| Implementation 1 |
Periods 2 2 - 3 |
Final exam and activity points, particulars to be announced during first lecture.
-
| 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. |
| Type | Name | Author | ISBN | URL | Edition, availability, ... | Examination material | Language |
| Book | Introduction to Coding and Information Theory | Steven Roman | Springer | English |
| Course | Mandatory/Advisable | Description |
| MAT-21160 Algoritmimatematiikka | Mandatory | |
| MAT-31090 Matriisilaskenta 1 | Advisable | |
| MAT-41156 Algebra 1 | Mandatory | |
| MAT-55406 Finite Fields | Advisable |
| Course | Corresponds course | Description |
|
|
|
| Description | Methods of instruction | Implementation | |
| Implementation 1 | Error-detecting and error-correcting codes based on linear algebra and polynomial rings over finite fields, and finite metric spaces. |