Relative generalized Hamming weights of evaluation codes (Q6171837)

The article under review gives an algebraic description of the relative generalized Hamming weights (RGHWs) of evaluation codes over the affine space in terms of the degree of the vanishing ideal of the evaluation points. Moreover, the authors give a lower bound for the RGHWs of evaluation codes using the rth-relative footprint. This bound is shown to be sharp for affine Cartesian codes and squarefree evaluation codes. Finally, the next-to-minimal weights of toric codes over hypersimplices are computed in some cases. The results are illustrated with examples obtained using the computer algebra system Macaulay2. The authors include the procedures in Macaulay2, which help to replicate the examples provided.