On decoding Reed-Solomon codes beyond half the minimum distanceDate: 2015-10-29 Add to Google Calendar
Time: 1:30-2:30 pm
Location: Holmes Hall 389
Speaker: Dr.-Ing. Martin Bossert, Professor, Ulm University, Germany
Reed-Solomon codes are not only used for error correction in storages and communications but also for plane and railway tickets, so called QR codes. To decode up to half the minimum distance there exist the classical Berlekamp-Massey and Euclidean algorithms. For decoding beyond half the minimum distance an extension of the syndrome, interleaving, or punctering is needed. The extension can be done by interpolation methods (Guruswami-Sudan, Wu) or by taking powers of the received symbols (Schmidt et al., Nielsen). Punctering can lead also to additional key equations as interleaving. The ideas of all these methods will be introduced with a focus on power decoding. Further, the concept of modul minimization for the solution of the key equations will be explained.
Prof. Dr.-Ing. Martin Bossert is Professor at Ulm University, Germany. He is a fellow of IEEE and the author of 4 textbooks on coding theory.