We begin studying a certain type of linear code the so-called Goppa codes. These codes are constructed by taking the evaluation of certain functions at points in Kn, where K is a finite field. As a generalization of this construction, we introduce the so-called evaluation codes defined over K-algebras satisfying some properties. For these codes, we describe a decoding algorithm and we show that if we consider classical one-point Goppa codes as an example of the new construction, this algorithm correct more errors that the classical algorithm for Goppa codes.