  The aim of this work is to give degree formulas for the generalized Hamming
weights of evaluation codes and to show lower bounds for these weights. In
particular, we give degree formulas for the generalized Hamming weights of
Reed--Muller-type codes, and we determine the minimum distance of toric codes
over hypersimplices, and the 1st and 2nd generalized Hamming weights of
squarefree evaluation codes.
