paper

The Weight Spectrum of the Affine Grassmann Code

arXiv:2609.08784

Abstract

In this article, we consider the affine Grassmann code , obtained from the affine open cell of the Grassmannian . We exploit the representation of codewords as linear combinations of minors of all sizes of a generic matrix and classify them according to the largest size of a minor occurring with a nonzero coefficient. Using this classification, we determine all possible Hamming weights of codewords of and, for each weight, compute the number of codewords attaining that weight. Consequently, we obtain the complete weight spectrum of the affine Grassmann code .

28 Pages, 1 Table

The Weight Spectrum of the Affine Grassmann Code $C^{\mathbb A}(3,6)$ · wovepaper