Loading
0000001694 21S 4SWS VI Coding Theory for Storage and Networks   Hilfe Logo

LV - Detailansicht

Wichtigste Meldungen anzeigenMeldungsfenster schließen
Allgemeine Angaben
Coding Theory for Storage and Networks 
0000001694
lecture with integrated exercises
4
Summer semester 2021
... alle LV-Personen
Associate Professorship of Coding and Cryptography (Prof. Wachter-Zeh)
(Contact information)
Details
Allocations: 1 
Angaben zur Abhaltung
- Decoding of Reed-Solomon codes beyond half the minimum distance: list decoding, power decoding.
- Interleaved Reed-Solomon codes and algorithms to correct burst errors.
- Network coding: Rank-metric codes, subspace codes, application to error-correction in networks.
- Coding for flash memories: write-once-memory codes, coding for stuck memory cells.
- Coding for distributed data storage: locally repairable codes, regenerating codes.
- Coding for correcting insertions and deletions.
- Mathematical basics (in particular linear algebra)
- The lecture "Channel Coding" is recommended.
At the end of the course, the students are able to
- name current areas of applications of coding theory,
- for those applications which were discussed in the lecture: to choose a suitable coding scheme, adapt its parameters, evaluate it, and implement it in software,
- for a known given coding scheme and a given application: to evaluate its error-correcting capabilities and limits, also in comparison to classical error-correcting codes,
- to understand coding schemes which were not discussed in the lecture after appropriate literature research.
English

lecture with integrated lab.

Lecture: The fundamental theoretical contents are presented in the lecture (by a slide presentation and on the black board) and illustrated with examples. Students are encouraged to ask questions and discuss the topics of the lecture.

Tutorial: In an accompanying tutorial, on the hand problems are calculated and discussed and on the other hand small programming tasks are given and supervised.
For these programming tasks, the content of the lecture is implemented in sagemath (Python). Therefore, task descriptions are handed out which are first presented by the teaching assistants. Afterwards the students will implement the programming tasks in teams of two students independently, with monitoring of the teaching assistants. After finishing a task, there will be a discussion of each team with a supervisor.
Details
Für die Anmeldung zur Teilnahme müssen Sie sich in TUMonline als Studierende*r identifizieren.
Zusatzinformationen
Online information
e-learning course (moodle)