On the Generalized Weights of a Class of Trace Codes

We build a class of codes using hermitian forms and the functional trace code. Then we give a general expression of the rth minimum distance of our code and compute general bounds for the weight hierarchy by using exponential sums. We also get the minimum distance and calculate the rth generalized Hamming weight dr in some special cases.