Computing generalized hamming weights of binary linear codes via free resolutions

DOI10.1145/3572867.3572868MaRDI QIDQ6110892zbMATH OpenFDO

Authors Ignacio García Marco, Irene Márquez-Corbella, E. Martínez-Moro, Yuriko Pitones

Publication date 2 August 2023

Published in ACM Communications in Computer Algebra (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Abstract: In this work, we explore the relationship between free resolution of some monomial ideals and Generalized Hamming Weights (GHWs) of binary codes. More precisely, we look for a structure smaller than the set of codewords of minimal support that provides us some information about the GHWs. We prove that the first and second generalized Hamming weight of a binary linear code can be computed (by means of a graded free resolution) from a set of monomials associated to a binomial ideal related with the code. Moreover, the remaining weights are bounded by the Betti numbers for that set.

Recommendations

• Generalized Hamming weights of linear codes
• Generalized Hamming weights for linear codes
• On generalized Hamming weights of some linear codes
• Generalized Hamming weights and semilinear equivalence of codes
• Weight functions and generalized Hamming weights of linear codes
• On generalized Hamming weights for Galois ring linear codes
• Generalized Hamming weights and equivalences of codes
• scientific article; zbMATH DE number 1009723
• Generalized Hamming Weights for Almost Affine Codes
• Generalized Hamming weights and some parameterized codes

Cited in

(1)

• Generalized weights of codes over rings and invariants of monomial ideals

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Computing generalized hamming weights of binary linear codes via free resolutions

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