• Lecturer: Jun.-Prof. Dr. Fleischhacker
• Language: German
• Credits: 6 CP
• Programs: B.Sc. Mathematics, B.Sc. IT-Security
• Examination: 100 % Written Exam (120 Minutes) + 10 % Homework

Course Description

The lecture gives an introduction to coding theory and computability theory.

Topic overview:

• Turing machine
• Complexity classes P and NP
• Polynomial reduction
• Quadratic remainders
• Uniquely decodable codes
• compact and optimal codes
• linear and dual codes