Revisiting the Weight Spectrum of the Affine Grassmann Code $C^{\mathbb{A}}(2,m)$

📅 2026-09-09
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
本文重新推导了仿射Grassmann码C^(A)(2,m)的重量谱,通过一种更简洁的方法,适用于所有m≥4和任意素数幂q,利用两个显式仿射子空间及其交集表达汉明重量。
📝 Abstract
Affine Grassmann codes, introduced by Beelen, Ghorpade and Høholdt, are linear codes over $\mathbb{F}_q$ obtained by evaluating linear combinations of minors of a generic matrix. The weight spectrum of the affine Grassmann code $C^{\mathbb{A}}(2,m)$ was determined by Piñero and Singh via a case analysis on the rank of an associated alternating matrix. We give an independent and more streamlined derivation, valid for all $m\ge4$ and every prime power $q$, in which each codeword is written in a compact matrix form and its Hamming weight is expressed through a single closed formula involving two explicit affine subspaces and their intersection.
Problem

Research questions and friction points this paper is trying to address.

Affine Grassmann Codes
Weight Spectrum
Linear Codes
Innovation

Methods, ideas, or system contributions that make the work stand out.

Affine Grassmann Codes
Weight Spectrum
Compact Matrix Form
Closed Formula
Affine Subspaces
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
No related jobs found.
R
Rohit Yadav
Department of Mathematics, Indian Institute of Technology, Jammu, Jammu–181221, India