The second minimum weight of Grassmann codes
arXiv:2508.18844
Abstract
We give an independent combinatorial proof of Nogin's Theorem concerning the minimum distance of the Grassmann codes using a special decomposition of the Grassmannians. We use the same idea to also compute the second minimum weight of the Grassmann codes.