Two new families of entanglement-assisted quantum MDS codes from generalized Reed–Solomon codes

Abstract

Entanglement-assisted quantum error-correcting codes (EAQECCs) make use of preexisting entanglement between the sender and receiver to boost the rate of transmission. It is possible to construct an EAQECC by any classical linear code. In this paper, we propose two constructions of generalized Reed–Solomon codes and calculate the dimension of their hulls. With these generalized Reed–Solomon codes, we present two new infinite families of EAQECCs, which are optimal with respect to the Singleton bound for EAQECCs. Notably, the parameters of our EAQECCs are new and flexible.