Name
Abstract | ||
|---|---|---|
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 we will calculate the minimum distance of some evaluation codes associated to a subset of the projective space that is a complete intersection. These codes are a generalization of the evaluation codes associated to a projective torus which are called generalized projective Reed-Solomon codes. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s00200-013-0184-1 | Appl. Algebra Eng. Commun. Comput. |
Keywords | Field | DocType |
Evaluation code,Projective space,Minimum distance,Complete intersection,94B27,94B60 | Hamming code,Discrete mathematics,Blocking set,Combinatorics,Complete intersection,Block code,Expander code,Complex projective space,Linear code,Mathematics,Projective space | Journal |
Volume | Issue | ISSN |
24 | 2 | 0938-1279 |
Citations | PageRank | References |
3 | 0.45 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manuel González Sarabia | 1 | 4 | 2.50 |
| Carlos Rentería-Márquez | 2 | 27 | 4.55 |
| Antonio J. Sánchez Hernández | 3 | 3 | 0.45 |