The second minimum weight of Grassmann codes
Combinatorics
2025-08-27 v1 Information Theory
math.IT
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.
Keywords
Cite
@article{arxiv.2508.18844,
title = {The second minimum weight of Grassmann codes},
author = {Mrinmoy Datta and Tiasa Dutta},
journal= {arXiv preprint arXiv:2508.18844},
year = {2025}
}