#### Filter Results:

#### Publication Year

2004

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Evaluation codes have been studied since some years ago. At the very beginning they were called projective Reed-Muller type codes and their main parameters (length, dimension and minimum distance) were computed in several particular cases. In fact, the length and dimension of the evaluation codes arising from a complete intersection are known. In this paper… (More)

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.

Let K be a finite field, let X ⊂ P m−1 and X ′ ⊂ P r−1 , with r < m, be two algebraic toric sets parameterized by some monomials in such a way that X ′ is embedded in X. We describe the relations among the main parameters of the corresponding parameter-ized linear codes of order d associated to X and X ′ by using some tools from commutative algebra and… (More)

- Manuel González Sarabia, Joel Nava Lara, Carlos Renteŕıa, Eliseo Sarmiento Rosales
- 2013

In this paper we will compute the main parameters of the parameteri-zed codes arising from cycles. In the case of odd cycles the corresponding codes are the evaluation codes associated to the projective torus and the results are well known. In the case of even cycles we will compute the length and the dimension of the corresponding codes and also we will… (More)

In this paper we compute the dual code of the evaluation codes arising from the incidence matrix of a complete bipartite graph.

In this paper we will estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We will find the length of these codes and we will give a formula for the dimension in terms of the Hilbert function associated to two ideals, one of them being the vanishing ideal of the projective torus. Also we will find an upper… (More)

In this paper we establish bounds for the main parameters of parameterized codes associated to the edges of a simple graph $$\mathcal {G}$$ G by using the relationships among these parameters and the corresponding ones of the parameterized codes associated to the edges of any subgraph of $$\mathcal {G}$$ G . These inequalities are used to find bounds in the… (More)

In this paper we estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We find the length of these codes and we give a formula for the dimension in terms of the Hilbert function associated to two ideals, one of them being the vanishing ideal of the projective torus. Also we find an upper bound for the… (More)