On Almost Maximum Distance Separable Codes

Abstract

The main goal of this paper is to make link between the subjects of projective
geometry, vector space and linear codes. The properties of codes and some examples
are shown. Furthermore, we will give some information about the geometrical
structure of the arcs. All these arcs are give rise to an error-correcting code that
corrects the maximum possible number of errors for its length.