Coding Theory Nico Döttling

Registration for this course is open until Wednesday, 20.09.2023 23:59.

News

29.11.2022

Correction from lecture 04

Dear students,

I got a bit overly excited in saying the Covering bound is an upper bound. It is of course a lower bound :D Lecture recording will be up soon.

To make the distinction clear:
A lower bound describes what is Definitely achievable in terms of code... Read more

Dear students,

I got a bit overly excited in saying the Covering bound is an upper bound. It is of course a lower bound :D Lecture recording will be up soon.

To make the distinction clear:
A lower bound describes what is Definitely achievable in terms of code dimension/number of codewords. So a code with the given number of codewords definitely exists, better codes MAY.
An upper bound describes a boundary above which codes cannot exist, this does not guarantee a code of that cardinality, it just says that no code with more words can possibly exist.

 

22.11.2022

Annoted slides not available for 21.11.

Dear students,

due to a mishap with my painting program, the slides with drawings from the lecture are severely malformed, I'll try to get them to work, but have the base slides in the mean time :) I quickly checked the beginning of the video and sound was... Read more

Dear students,

due to a mishap with my painting program, the slides with drawings from the lecture are severely malformed, I'll try to get them to work, but have the base slides in the mean time :) I quickly checked the beginning of the video and sound was alright, the video will come up a bit later, when I got to check it.

-Stella

09.11.2022

No lecture on 14.11.22

Dear Students,

as announced in the last lecture, there will be no lecture on 14.11.22.

 

Coding Theory

Coding theory studies the problem of transmitting information in a setting where errors in the communication can ocurr.
In this course, basic concepts of coding theory are presented. These include classical results such as Shannon’s coding theorem and algebraic coding constructions but also modern concepts such as expander codes. In addition, applications of coding theory in cryptography and complexity theory are presented which are beyond the original purpose of robust signal transmission.


This course will deal with concepts from linear algebra (vector spaces), finite fields and polynomials over finite fields; some familiarity with these notions and with basic probability theory is assumed.


The participants in this course will acquire a solid understanding of the basic concepts and methods in modern coding theory.

Literature

You can access the textbook of van Lint from inside the Campus here

Date and Location

The Lecture will take place Mondays at 10:15 at the CISPA lecture hall. The lecture will also be live-streamed on zoom. The first lecture will be on Monday, 31.10.22



Privacy Policy | Legal Notice
If you encounter technical problems, please contact the administrators