论文信息 - Affine Grassmann Codes

Affine Grassmann Codes

We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. We determine the length, dimension, and the minimum distance of any affine Grassmann code. Moreover, we show that affine Grassmann codes have a large automorphism group and determine the number of minimum weight codewords.

[1] L. Mirsky,et al. The Theory of Matrices , 1961, The Mathematical Gazette.

[2] Harish K. Pillai,et al. Decomposable subspaces, linear sections of Grassmann varieties, and higher weights of Grassmann codes , 2007, Finite Fields Their Appl..

[3] Dmitry Yu. Nogin,et al. Codes associated to Grassmannians , 1996 .

[4] Gian-Carlo Rota,et al. On the Foundations of Combinatorial Theory: IX Combinatorial Methods in Invariant Theory , 1974 .

[5] Jean-Marie Goethals,et al. On Generalized Reed-Muller Codes and Their Relatives , 1970, Inf. Control..

[6] K. Ranestad,et al. GRASSMANN CODES AND SCHUBERT UNIONS , 2010 .

[7] R. Brualdi,et al. Handbook Of Coding Theory , 2011 .

[8] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .

[9] F. R. Gantmakher. The Theory of Matrices , 1984 .

[10] W. Marsden. I and J , 2012 .

[11] Sudhir R. Ghorpade,et al. Abhyankar’s Work on Young Tableaux and Some Recent Developments , 1994 .

[12] Sudhir R. Ghorpade,et al. Higher Weights of Grassmann Codes , 2000 .

[13] Thierry P. Berger,et al. The automorphism group of Generalized Reed-Muller codes , 1993, Discret. Math..

[14] Peter Lancaster,et al. The theory of matrices , 1969 .