摘要
The entanglement-assisted quantum error-correcting (EAQEC) codes have the potential to greatly generalize and enhance the performance of existing quantum error-correcting codes. In this paper, we investigate EAQEC codes of length q(2)-1/r, where r is a positive divisor of q + 1. Most of these codes are new, and some of them have better performance than ones obtained in the literature. The resulting EAQEC codes are maximum-distance-separable (MDS) if the minimum distance d <= n+2/2.