Parameterized Codes over Cycles

In this paper we will compute the main parameters of the parameterized codes arising from cycles. In the case of odd cycles the corresponding codes are the evaluation codes associated to the projective torus and the results are well known. In the case of even cycles we will compute the length and the dimension of the corresponding codes and also we will find lower and upper bounds for the minimum distance of this kind of codes. In many cases our upper bound is sharper than the Singleton bound.