Have a personal or library account? Click to login
Some bounds for the relative generalized Hamming weights of some evaluation codes Cover

Some bounds for the relative generalized Hamming weights of some evaluation codes

Open Access
|Sep 2017

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.

DOI: https://doi.org/10.1515/auom-2016-0041 | Journal eISSN: 1844-0835 | Journal ISSN: 1224-1784
Language: English
Page range: 261 - 270
Submitted on: Apr 14, 2015
|
Accepted on: Jun 30, 2015
|
Published on: Sep 21, 2017
In partnership with: Paradigm Publishing Services
Publication frequency: 3 issues per year

© 2017 Manuel González Sarabia, published by Ovidius University of Constanta
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.