Maximal entanglement EAQECCs from cyclic and constacyclic codes over Fq+v1Fq+...+vs-1Fq

Let Rs-1 = F-q + v(1)F(q) + ... + v(s-1)F(q) be a finite non -chain ring, where q is an odd prime power, v(i)(2) = v(i), v(i)v(j) = v(i) v(i) = 0 for 1 <= i, j <= s - 1. In this paper, a class of maximal entanglement (ME) entanglement-assisted quantum error-correcting codes (EAQECCs) are obtained from Gray images of cyclic codes over Rs-1. By a special Gray map, a class of maximal entanglement and maximum distance separable EAQECCs (ME-MDS EAQECCs) are constructed from Gray images of (1 - 2v(1))-constacyclic codes over R-1 = F-q + v(1)F(q), where v(1)(2) = v(1). Furthermore, some new ME EAQECCs are tabulated by comparing with some known EAQECCs.