In this project we consider old as well as new constructions of evaluation codes and duals of evaluation codes. We are concerned with describing the dimensions, the lengths, the minimum distances and in some cases the generalized Hamming weights of the codes. We find the true values of these parameters for some classes of well-known codes and we construct new classes of codes that perform well with respect to the parameters. We use methods from order domain theory as well as methods from Gröbner basis theory as well as basic linear algebra methods.
|Effective start/end date||01/09/2005 → 01/09/2006|