2026-05-15T05:48:13Zhttps://uvadoc.uva.es/oai/requestoai:uvadoc.uva.es:10324/618642025-02-21T10:44:53Zcom_10324_1145com_10324_931com_10324_894col_10324_1254
García Marco, Ignacio
Marquez Corbella, Irene
Martínez Moro, Edgar
Pitones, Yuriko
2022
Producción Científica
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.
application/pdf
https://uvadoc.uva.es/handle/10324/61864
eng
MDPI
Algebraic geometry
Free resolution
Computer science
Mathematics
Códificación (Informática)
Computer systems
1201.01 Geometría Algebraica
1203.17 Informática
12 Matemáticas
Free resolutions and generalized Hamming weights of binary linear codes
info:eu-repo/semantics/article
TEXT
UVaDOC. Repositorio Documental de la Universidad de Valladolid
Hispana