Skip to content
DraconiticResearch
Search Sources API
201,683 studies31 sourcesUpdated 58 min ago
PreprintarXiv licencearXiv

The Weight Spectrum of the Affine Grassmann Code C𝔸(3,6)

Abstract

In this article, we consider the affine Grassmann code C𝔸(3,6), obtained from the affine open cell 𝔸9 of the Grassmannian G3,6. We exploit the representation of codewords as linear combinations of minors of all sizes of a generic 3×3 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 C𝔸(3,6) and, for each weight, compute the number of codewords attaining that weight. Consequently, we obtain the complete weight spectrum of the affine Grassmann code C𝔸(3,6).

Related

  1. Revisiting the Weight Spectrum of the Affine Grassmann Code C𝔸(2,m)
    Rohit Yadav
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  2. Fusion rules and rigidity for weight modules over the simple admissible affine sl(2) and N=2 superconformal vertex operator superalgebras
    Hiromu Nakano, Florencia Orosz Hunziker, Ana Ros Camacho +1
    Advances in MathematicsPeer-reviewedLicence not statedFull text15 citedGeometry & topologyOpenAlex
  3. Hausdorff spectrum of Lyapunov exponents for higher-dimensional self-affine systems
    Balázs Bárány, Reza Mohammadpour
    arXivPreprintarXiv licenceFull textAnalysis & PDEsDynamical systemsarXiv
  4. An Affine Semigroup from Orbifold Boundary Conditions: cut, phylogenetic and hierarchical models in the unit-weight sector, and weighted configurations beyond them
    Carles Marín
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  5. Linear Equivalence of Full Weight Spectrum Cyclic Orbit Codes
    Minjia Shi, Ferruh Ozbudak
    arXivPreprintCC0Full textGeneral mathematicsarXiv
BibTeX
@misc{singh2026weight,
  title = {{The Weight Spectrum of the Affine Grassmann Code $C^\mathbb A(3,6)$}},
  author = {Prasant Singh and Rohit Yadav},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2609.08784},
  eprint = {2609.08784},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.08784},
}
RIS
TY  - UNPB
TI  - The Weight Spectrum of the Affine Grassmann Code C^𝔸(3,6)
AU  - Prasant Singh
AU  - Rohit Yadav
PY  - 2026
DA  - 2026/10/09
PB  - arXiv
DO  - 10.48550/arxiv.2609.08784
UR  - https://arxiv.org/abs/2609.08784
AB  - In this article, we consider the affine Grassmann code C^𝔸(3,6), obtained from the affine open cell 𝔸^9 of the Grassmannian G_3,6. We exploit the representation of codewords as linear combinations of minors of all sizes of a generic 3×3 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 C^𝔸(3,6) and, for each weight, compute the number of codewords attaining that weight. Consequently, we obtain the complete weight spectrum of the affine Grassmann code C^𝔸(3,6).
ER  -