The Second Generalized Hamming Weight of Some Evaluation Codes Arising from Complete Bipartite Graphs
نویسنده
چکیده
In this paper we compute the second generalized Hamming weight of the evaluation codes associated to complete bipartite graphs. The main result depends on the minimum distance and second generalized Hamming weight of the generalized Reed-Solomon codes.
منابع مشابه
The second generalized Hamming weight of some evaluation codes arising from a projective torus
In this paper we find the second generalized Hamming weight of some evaluation codes arising from a projective torus, and it allows to compute the second generalized Hamming weight of the codes parameterized by the edges of any complete bipartite graph. Also, at the beginning, we obtain some results about the generalized Hamming weights of some evaluation codes arising from a complete intersect...
متن کاملThe Dual Code of Some Evaluation Codes Arising from Complete Bipartite Graphs
In this paper we compute the dual code of the evaluation codes arising from the incidence matrix of a complete bipartite graph. Mathematics Subject Classification: 94B27, 94B60
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملSome bounds for the relative generalized Hamming weights of some evaluation codes
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 ...
متن کاملOn the second Hamming weight of some Reed-Muller type codes
Abstract. We study affine cartesian codes, which are a Reed-Muller type of evaluation codes, where polynomials are evaluated at the cartesian product of n subsets of a finite field Fq. These codes appeared recently in a work by H. López, C. Renteŕıa-Marquez and R. Villareal (see [11]) and, independently, in a generalized form, in a work by O. Geil and C. Thomsen (see [9]). Using a proof techniq...
متن کامل