Minimum distance of some evaluation codes

Manuel González Sarabia, Carlos Rentería Márquez, Antonio J.Sánchez Hernández

Producción científica: Contribución a una revistaArtículorevisión exhaustiva

6 Citas (Scopus)

Resumen

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.

Idioma originalInglés
Páginas (desde-hasta)95-106
Número de páginas12
PublicaciónApplicable Algebra in Engineering, Communications and Computing
Volumen24
N.º2
DOI
EstadoPublicada - jun. 2013

Huella

Profundice en los temas de investigación de 'Minimum distance of some evaluation codes'. En conjunto forman una huella única.

Citar esto