Name
Abstract | ||
|---|---|---|
In this paper we find the complete weight hierarchy of the codes parameterized by the edges of the cycle C 4 and an upper bound in the case of the complete bipartite graph K 2 , 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 C X ( d ) and the generalized Hamming weights of the parameterized code of the form C X ' ( d ) , when X ' is embedded in X . |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.disc.2015.10.026 | Discrete Mathematics |
Keywords | Field | DocType |
Toric set,Parameterized code,Generalized Hamming weight,Minimum distance,Embedded set | Discrete mathematics,Hamming code,Combinatorics,Hamming(7,4),Cyclic code,Hamming distance,Linear code,Hamming weight,Hamming bound,Mathematics,Hamming graph | Journal |
Volume | Issue | ISSN |
339 | 2 | 0012-365X |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manuel González Sarabia | 1 | 4 | 2.50 |
| Carlos Rentería-Márquez | 2 | 27 | 4.55 |