Maximal entanglement entanglement assisted quantum codes from quaternary BCH codes
Maximal entanglement entanglement assisted quantum error correcting codes (EAQECCs) can achieve the EA hashing bound asymptotically, and a higher rate and/or better noise suppression capabilities may be achieved by exploiting maximal entanglement. In this work, we discuss construction of some families of [n, k, d] zero radical codes with minimal distance d 6, 8, 10, 12, 14 from two classes of quaternary Bose Chaudhuri Hocquenghem (BCH) codes. Using these zero radical codes, we construct many maximal entanglement EAQECCs with very good parameters. We calculate the parameters of these EAQECCs by easily algebraical method, rather than by usually method of computation by computer. The maximal entanglement EAQECCs presented here have better parameters than those available in the literature.
2015 IEEE Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)