Evaluation Codes from an Affine Variety Code Perspective
Olav Geil · Series on coding theory and cryptology · 2008
Abstract: Evaluation codes (also called order domain codes) are traditionally introduced as generalized one-point geometric Goppa codes. In the present paper we will give a new point of view on evaluation codes by introducing them instead as particular nice examples of affine variety codes. Our study includes a reformulation of the usual methods to estimate the minimum distances of evaluation codes into the setting of affine variety codes. Finally we describe the connection to the theory of one-point geometric Goppa codes.