|
|
MAT-55406 ÄÄRELLISET KUNNAT, 4 cr
|
Person responsible
Stephan Foldes
Lecturers
Stephan Foldes, professor
Lecture room and time
Per II: Tuesday 14 - 16, TB214
Per II: Wednesday 14 - 15, TB110
Per III: Tuesday 14 - 16, TB215
Implementation rounds
Implementation 1
| Period 1 | Period 2 | Period 3 | Period 4 | Period 5 | Summer | Language of instruction | |
| Lecture | - | 3 h/week+ | 2 h/week | - | - | - | In English only |
| Exercise | - | 2 h/week+ | 2 h/week | - | - | - | In English only |
| Exam | In English only | ||||||
Contents
| Content | Core content | Complementary knowledge | Specialist knowledge |
| 1. | Basic ring and field theory. The 2-element field. Special properties of finite fields. | ||
| 2. | Existence and uniqueness of finite fields. | ||
| 3. | Linear and polynomial algebra over finite fields. Finite planes and other geometries over finite fields. |
Requirements for completing the course
Final exam and activity points, particulars to be announced during first lecture.
Assessment criteria
Study material
| Type | Name | Author | ISBN | URL, edition, availablitity... | Exam material | Language |
| Book | Finite Fields for Computer Scientists and Engineers | R.J. McEliece | Kluwer Academic Publishers | Yes | English |
Prerequisites
| Number | Name | Credits | M/R |
| MAT-21160 | Mathematics for Algorithms | 3 | Mandatory |
| MAT-41156 | Algebra 1 | 5 | Mandatory |
Other comments
Lectures in English. This course is a compulsory prerequisite for the course 73120 Coding Theory. Students wishing to explore possible research or teaching involvement in the area of discrete mathematics / theoretical computer science are invited to communicate their interest. The course is given biannually. It is given in the academic year 2005-2006.
Correspondence of content
7305040 Finite Fields
| Last modified | 08.03.2005 |
| Modified by | Arto Aho |