back to search

Coding Theory

CIT413045Elective Modules9 ECTSEnglishUnregelmäßigDepartment Mathematics
AI-edited module sheet. Based on the TUMonline module description, edited for readability.Original in TUMonline

What it is about

You will learn the fundamentals of algebraic coding theory: important bounds, constructions and decoding procedures for various code classes as well as applications, e.g. in cryptography. In the end you will be able to apply the central theorems and transfer methods to concrete problems and examples.

What you will be able to do

  • Understand the basic concepts of coding theory
  • Apply important bounds (Singleton, Hamming, Gilbert-Varshamov, Plotkin)
  • Understand code constructions (e.g. Reed–Solomon, Simplex, Goppa, cyclic codes)
  • Apply decoding procedures for the mentioned codes
  • Familiarize with fundamentals of rank-metric codes
  • Classify applications of coding theory in cryptography

What the module consists of

  • LectureDelivery of content on the board and provision of lecture materials
  • TutorialDiscussion and application of problem sheets; deepening through discussion

Teaching method

  • Board lecturefor the step-by-step development of the theory
  • Lecture notes/Handoutsas a continuously updated reference for the content
  • Problem sheets and exercise sessionsfor application and deepening of what has been learned
No dates in the current semester
There are no course dates for this module this semester, or they haven't been matched yet.

Module ratings

No ratings for this module yet.

Rate this module

Only fill in the categories you can judge – for each one, either stars and text together or nothing at all.

Lecture
Tutorial
Exam

Reviews are automatically checked before they are published.

Official page in TUMonline · Details are not binding.