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.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。