Some bounds for the relative generalized Hamming weights of some evaluation codes
2016 ◽
Vol 24
(2)
◽
pp. 261-270
Keyword(s):
Abstract 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 Tn₁-1 and Tn₂-1.
2014 ◽
Vol 60
(10)
◽
pp. 5930-5937
◽
1997 ◽
Vol 43
(1)
◽
pp. 299-308
◽
2006 ◽
Vol 39
(2)
◽
pp. 215-231
◽
1992 ◽
Vol 38
(3)
◽
pp. 1133-1140
◽
2018 ◽
Vol 30
(3)
◽
pp. 233-242
◽
1997 ◽
Vol 43
(1)
◽
pp. 330-335
◽