Hermitian codes and complete intersections
arXiv:1510.03670 · doi:10.1016/j.ffa.2019.101621
Abstract
In this paper we present a geometrical characterization for the minimum-weight codewords of the Hermitian codes over the fields in the third and fourth phase, namely with distance . We consider the unique writing of the distance with non negative integers, and , and prove that the minimum-weight codewords correspond to complete intersection divisors cut on the Hermitian curve by curves of degree having as leading term w.r.t. the term ordering (with ). Moreover, we show that any such curve corresponds to minimum-weight codewords provided that the complete intersection divisor is made of simple -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 .
References in corpus (6)
- The dual minimum distance of arbitrary dimensional algebraic--geometric codes
- Relative generalized Hamming weights of one-point algebraic geometric codes
- Improved decoding of affine-variety codes
- Higher Hamming weights for locally recoverable codes on algebraic curves
- On the Hermitian curve and its intersections with some conics
- Minimum-weight codewords of the Hermitian codes are supported on complete intersections