Generalized Hamming weights and some parameterized codes

In this paper we find the complete weight hierarchy of the codes parameterized by the edges of the cycle C4 and an upper bound in the case of the complete bipartite graph K2,n. Moreover we find some bounds for the generalized Hamming weights of some codes parameterized by a set of monomials of the s...

Full description

Saved in:
Bibliographic Details
Published in:Discrete mathematics 2016-02, Vol.339 (2), p.813-821
Main Authors: González Sarabia, Manuel, Rentería Márquez, Carlos
Format: Article
Language:English
Subjects:
Embedded set
Generalized Hamming weight
Minimum distance
Parameterized code
Toric set
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we find the complete weight hierarchy of the codes parameterized by the edges of the cycle C4 and an upper bound in the case of the complete bipartite graph K2,n. Moreover we find some bounds for the generalized Hamming weights of some codes parameterized by a set of monomials of the same degree. These bounds work in the case of codes parameterized by the edges of any simple graph G. Also we establish the relationships among the generalized Hamming weights of any parameterized code of the form CX(d) and the generalized Hamming weights of the parameterized code of the form CX′(d), when X′ is embedded in X.
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2015.10.026