In this study, we consider linear and especially cyclic codes over the non-chain ring Zp[v]/〈v − v〉 where p is a prime. This is a generalization of the case p = 3. Further, in this work the structure of constacyclic codes are studied as well. This study takes advantage mainly from a Gray map which preserves the distance between codes over this ring and p-ary codes and moreover this map enlighte...

Let p be an odd prime, where ϑ and m are positive integers. ψ a nonzero element of the finite field Fq, q=pm, R=Fq+uFq+u2Fq(u3=0). In this paper, we determine completely symbol-triple distances all ψ-constacyclic codes length pϑ over R.