In this work, we explore the relationship between the graded free resolution of some monomial ideals and the Generalized Hamming Weights (GHWs) of binary codes. More precisely, we look for a structure that is smaller than the set of codewords of minimal support that provides us with some information about the GHWs. We prove that the first and second generalized Hamming weights of a binary linear code can be computed (by means of a graded free resolution) from a set of monomials associated with a binomial ideal related with the code. Moreover, the remaining weights are bounded above by the degrees of the syzygies in the resolution.
Excepté là où spécifié autrement, la license de ce document est décrite en tant que Atribución 4.0 Internacional