Algebraic Structure of Convolutional Codes and their use over the Erasure Channel.

**Fecha de inicio**: 01/02/2014. **Fecha de fin**: 11/02/2014. **Hora de inicio:** 12:00. **Hora de fin:** 13:00.

There exist few algebraic decoding algorithms for convolutional codes. The existing algorithms which find the maximum likelihood code word like e.g. the Viterbi decdoing algorithm are highly complex.

In this talk we explain how to find the maximum likelihood code word over the erasure channel in an efficient way. Codes capable of decoding a maximum number of errors should have a maximum distance profile and be in addition

MDS codes. The presented results constitute joint work with Virtudes Tomas and Roxana Smarandache.