2013 Uni Ulm & TUM Workshop on Coding Theory
On February 21, 2013, Professor Martin Bossert and several of his scientific staff from Ulm University visited the LNT for a workshop on Coding. The workshop focus was primarily algebraic coding, especially Reed-Solomon codes and Gabidulin codes; LDPC codes were also considered.
Workshop Program
| 10:00 | Arrival, introductions, general milling about |
| 10:14 | Opening Remarks |
| 10:15 | Mostafa Hosni Mohamed (ULM): A Chase-like Decoding Algorithm for Reed-Solomon Codes Based on the Euclidean Algorithm |
| 10:45 | Hannes Bartz (TUM): On Locally Repairable Codes |
| 11:15 | Wenhui Li (ULM): On Decoding of Interleaved Chinese Remainder Codes |
| 11:45 | Alexander Zeh (ULM): Why do we Need Lowest-code-rate Cyclic Codes with Small Minimum Distances? |
| 12:15 | Lunch Break |
| 14:00 | Markus Stinner (TUM): Finite-Length Scaling for Low-Density Parity-Check Codes |
| 14:30 | Christian Senger (ULM): Efficient Welch-Berlekamp Interpolation using Matrix Displacement |
| 15:00 | Joschi Brauchle (TUM): Erasure Decoding of Gabidulin Codes using Composition of Linearized Polynomials |
| 15:30 | Coffee Break |
| 16:00 | Antonia Wachter-Zeh (ULM): Bounds on List Decoding of Rank Metric Codes |
| 16:30 | Vladimir Sidorenko (ULM): On Transform-domain Decoding of Gabidulin Codes |
| 17:00 | Closing Remarks |
Supported by
