Minimum distance of some evaluation codes

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

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

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.

Original languageEnglish
Pages (from-to)95-106
Number of pages12
JournalApplicable Algebra in Engineering, Communications and Computing
Volume24
Issue number2
DOIs
StatePublished - Jun 2013

Keywords

  • Complete intersection
  • Evaluation code
  • Minimum distance
  • Projective space

Fingerprint

Dive into the research topics of 'Minimum distance of some evaluation codes'. Together they form a unique fingerprint.

Cite this