Coding Theory for Storage and Networks
| Lecturer (assistant) | |
|---|---|
| Number | 0000001694 |
| Type | lecture with integrated exercises |
| Duration | 4 SWS |
| Term | Summer semester 2026 |
| Language of instruction | English |
| Position within curricula | See TUMonline |
| Dates | See TUMonline |
Admission information
Description
- Coding for efficient data recovery in distributed data storage: locally repairable codes and regenerating codes.
- 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 correcting insertions and deletions.
- Coding for non-volatile memory: coding for stuck and partially stuck cells.
- 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 correcting insertions and deletions.
- Coding for non-volatile memory: coding for stuck and partially stuck cells.
Prerequisites
- Mathematical basics (in particular linear algebra)
- The lecture "Channel Coding" is recommended.
- The lecture "Channel Coding" is recommended.
Teaching and learning methods
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.
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.