2026-05-19T03:42:02Zhttps://uvadoc.uva.es/oai/requestoai:uvadoc.uva.es:10324/618642025-02-21T10:44:53Zcom_10324_1145com_10324_931com_10324_894col_10324_1254
00925njm 22002777a 4500
dc
García Marco, Ignacio
author
Marquez Corbella, Irene
author
Martínez Moro, Edgar
author
Pitones, Yuriko
author
2022
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.
Mathematics, 2022, Vol. 10, Nº. 12, 2079
2227-7390
https://uvadoc.uva.es/handle/10324/61864
10.3390/math10122079
2079
12
Mathematics
10
2227-7390
Algebraic geometry
Free resolution
Computer science
Mathematics
Códificación (Informática)
Computer systems
Free resolutions and generalized Hamming weights of binary linear codes