|
|
MAT-55406 FINITE FIELDS, 4 cr
|
Courses persons responsible
Stephane Foldes
Lecturetimes and places
Per II: Monday 14 - 16, TC163
Per II: Monday 14 - 16, TD308
Per II: Tuesday 14 - 15, TD308
Per III: Monday 17 - 19, TB220
Implementations
| Period 1 | Period 2 | Period 3 | Period 4 | Period 5 | Summer | |
| Lecture | - | 3 h/week | 2 h/week | - | - | - |
| Exercise | - | 2 h/week | 2 h/week | - | - | - |
| Exam | ||||||
Content
| 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. | Polynomials 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 the first lecture.
Evaluation criteria for the course
Study material
| Type | Name | Auhor | ISBN | URL | Edition, availability... | Exam material | Language |
| Book | Finite Fields for Computer Scientists and Engineers | R.J. McEliece | Kluwer Academic Publishers | Yes | English | ||
| Book | Fundamental Structures of Algebra & Discrete Mathematics | S. Foldes | Wiley | No | English |
Prerequisites
| Code | Course | Credits | M/R |
| MAT-21160 | MAT-21160 Mathematics for Algorithms | 3 | Mandatory |
| MAT-41156 | MAT-41156 Algebra 1 | 5 | Mandatory |
Prequisite relations (Sign up to TUT Intranet required)
Remarks
Lectures in English. This course is a recommended 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 every second year. It will be given in the academic year 2007-2008.
Correspondence of content
7305040 Finite Fields
| Last modified | 12.02.2007 |
| Modified by | Janne Kauhanen |