TY - JOUR
T1 - Some bounds for the relative generalized Hamming weights of some evaluation codes
AU - González Sarabia, Manuel
N1 - Publisher Copyright:
© 2016, Ovidius University. All rights reserved.
PY - 2016
Y1 - 2016
N2 - In this paper we find some bounds for the relative generalized Hamming weights of some codes parameterized by a set of monomials of the same degree. Also we compare the relative generalized Hamming weights of the codes CX (d) and CX′ (d) when X′ is embedded in X. We use these results to obtain some lower bounds for the relative generalized Hamming weights of the codes parameterized by the edges of any connected bipartite graph with bipartition (V1, V2) and where |V1| = n1, |V2| = n2, in terms of the relative generalized Hamming weights of the codes associated to the projective tori Tn1−1 and Tn2−1.
AB - In this paper we find some bounds for the relative generalized Hamming weights of some codes parameterized by a set of monomials of the same degree. Also we compare the relative generalized Hamming weights of the codes CX (d) and CX′ (d) when X′ is embedded in X. We use these results to obtain some lower bounds for the relative generalized Hamming weights of the codes parameterized by the edges of any connected bipartite graph with bipartition (V1, V2) and where |V1| = n1, |V2| = n2, in terms of the relative generalized Hamming weights of the codes associated to the projective tori Tn1−1 and Tn2−1.
KW - Parameterized code
KW - Relative generalized Hamming weight
KW - Toric set
UR - http://www.scopus.com/inward/record.url?scp=84991696535&partnerID=8YFLogxK
U2 - 10.1515/auom-2016-0041
DO - 10.1515/auom-2016-0041
M3 - Artículo
SN - 1224-1784
VL - 24
SP - 261
EP - 270
JO - Analele Stiintifice ale Universitatii Ovidius Constanta, Seria Matematica
JF - Analele Stiintifice ale Universitatii Ovidius Constanta, Seria Matematica
IS - 2
ER -