Hermitian codes and complete intersections

From MaRDI portal




Abstract: In this paper we present a geometrical characterization for the minimum-weight codewords of the Hermitian codes over the fields mathbbFq2 in the third and fourth phase, namely with distance dgeqq2q. We consider the unique writing muq+lambda(q+1) of the distance d with mu,lambda non negative integers, and muleqq, and prove that the minimum-weight codewords correspond to complete intersection divisors cut on the Hermitian curve mathcalH by curves mathcalX of degree mu+lambda having xmuylambda as leading term w.r.t. the extttDegRevLex term ordering (with y>x). Moreover, we show that any such curve mathcalX corresponds to minimum-weight codewords provided that the complete intersection divisor mathcalHcapmathcalX is made of simple mathbbFq2-points. Finally, using this geometric characterization, we propose an algorithm to compute the number of minimum weight codewords and we present comparison tables between our algorithm and MAGMA command mathttMinimumWords.



Cites work







This page was built for publication: Hermitian codes and complete intersections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2302573)