Éditeur(s) : HAL CCSD Elsevier
Résumé : International audience
We build a class of codes using hermitian forms and the functional trace code. Then we give a general expression of the r-th 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 r-th generalized Hamming weight dr in some special cases.
ISSN: 1071-5797

hal-00771922
https://hal.univ-antilles.fr/hal-00771922

Éditeur(s) : HAL CCSD
Résumé : 17 pages
We look at the number of solutions of an equation of the form f_1*f_2*...*f_k=a in a finite field, where each f_i is a multilinear polynomial. We use two methods to construct a solution of this problem for the cases a=0, a<>0, and we generally get a semi-explicit formula. We show that this formula can generate a more efficient algorithm than the traditional algorithm which consists to make a systematic computation. We also give explicit formulas in some special cases, and an application of our main result to the search of the weight hierarchy of the multilinear code with separated variables.
https://hal.univ-antilles.fr/hal-00772478

hal-00772478
https://hal.univ-antilles.fr/hal-00772478
ARXIV : math.NT/0603057