Institut für MathematikHome > Academic programme > Seminars & Colloquia > Arbeitsgemeinschaft in Codierungstheorie und Kryptographie > Construction of MDP convolutional codes

  Deutsch  |  Contact  |  Print  |  Search  

FÜR SCHÜLERiNNEN
INSTITUTE
ACADEMIC PROGRAMME
COLLOQUIA/SEMINARS
STUDENT SEMINARS
LECTURE COURSES
MODULES
CONFERENCES/EVENTS
VORKURSE
FOR STUDENTS
FOR PhD STUDENTS



Modul:   MAT076  Arbeitsgemeinschaft in Codierungstheorie und Kryptographie


Construction of MDP convolutional codes

Dr. Julia Lieb's talk

Speaker invited by: Prof. Dr. Joachim Rosenthal

Date: 11.10.17   Time: 16.00 - 17.00   Room: UNINE, A317

Convolutional codes whose column distances increase as rapidly as possible for as long as possible are called maximum distance profile (MDP) convolutional codes. These codes are important for maximizing the error correction in sequential decoding algorithms. This is especially true for so-called reverse MDP and complete MDP convolutional codes, which have additional advantageous qualities. The existence of (reverse) MDP convolutional codes for all code parameters has already been proven. In this talk, we do the same for complete MDP convolutional codes. Moreover, we present known constructions of MDP convolutional codes and use them to derive constructions of complete MDP convolutional codes. Another crucial issue is the construction of MDP convolutional codes over fields of small size and the determination of bounds on the field size such that a construction is possible. We show that existing bounds are far away from being optimal, especially for large code rates. Finally, for some special choices for the code parameters, we give sharper bounds on the field size and construction examples for small parameters.