Affine Cartesian codes (Q2439742)

In this paper the affine cartesian codes are introduced. These codes are evaluation codes defined on a cartesian product of finite sets. Let \(X^*\) denote the cartesian product of \(n\) finite subsets \(A_1,\dots,A_n\) of a fixed field \(K\), and fix \(m\) points of \(X^*\), \(P_1,\dots,P_m\). The evaluation of polynomials of \(K[x_1,\dots,x_m]\), with degree less than \(d\), is called affine cartesian code and it is denoted by \(C_{X^*}(d)\). In section 3 the authors investigate the parameters of the code \(C_{X^*}(d)\), in particular in Theorem 3.8 they report a formula for the minimum distance of \(C_{X^*}(d)\). In section 4 the authors consider cartesian codes over degenerated tori. In this case they show an exact formula for the dimension and the minimum distance of such codes.