AI & ML
The Weight Spectrum of the Affine Grassmann Code $C^{\mathbb A}(3,6)$
arXiv math.IT0 views
arXiv:2609.08784v3 Announce Type: replace Abstract: In this article, we consider the affine Grassmann code $C^{\mathbb A}(3,6)$, obtained from the affine open cell ${\mathbb A}^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\times3$ 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^{\mathbb A}(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^{\mathbb A}(3,6)$.
Source:https://arxiv.org/abs/2609.08784PreviousMean Gain Is Not a Guarantee: Risk-Controlled Open-Loop Scheduling for Ka-Band LEO Semantic DownlinksNextTTS-Q: Perception-Guided Post-Training Quantization of Text-to-Speech Diffusion Transformers
Related posts

Copilot Fusion's Local Model Preview: Only One of Three Stages Runs on Your Machine
0dev.to AI

Meituan shipped LongCat-2.5
0dev.to AI
Standard bf16 Rounding Discards 99% of Your RL Policy Updates
0dev.to AI
Why Are Startups Choosing Coworking Space in Pune in 2026?
0dev.to AI
What a 32GB GPU actually lets you run locally
0dev.to AI

LLM weak random number generator detection test
0dev.to Security