Higher weights of affine Grassmann codes and their duals

DOI10.1090/CONM/637/12750MaRDI QIDQ2811785zbMATH OpenOpenAlexFDO

Authors Mrinmoy Datta, Sudhir R. Ghorpade

Publication date 10 June 2016

Published in Algorithmic Arithmetic, Geometry, and Coding Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1503.02196

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: We consider the question of determining the higher weights or the generalized Hamming weights of affine Grassmann codes and their duals. Several initial as well as terminal higher weights of affine Grassmann codes of an arbitrary level are determined explicitly. In the case of duals of these codes, we give a formula for many initial as well as terminal higher weights. As a special case, we obtain an alternative simpler proof of the formula of Beelen et al for the minimum distance of the dual of an affine Grasmann code.

Recommendations

• The structure of dual Grassmann codes
• scientific article; zbMATH DE number 1461536
• Higher weights for the Lagrangian-Grassmannian codes
• Decomposable subspaces, linear sections of Grassmann varieties, and higher weights of Grassmann codes
• The weight spectrum of certain affine Grassmann codes

Cited in

(7)

• Higher weights for the Lagrangian-Grassmannian codes
• Subclose Families, Threshold Graphs, and the Weight Hierarchy of Grassmann and Schubert Codes
• Hyperplane sections of determinantal varieties over finite fields and linear codes
• The structure of dual Grassmann codes
• The weight spectrum of certain affine Grassmann codes
• The weights of the dual code of the MELAS code over GF(3)
• Generalized minimum distance functions

This page was built for publication: Higher weights of affine Grassmann codes and their duals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811785)