Optimal Asymmetric Quantum Codes from the Euclidean Sums of Linear Codes
Peng Xu, Xiusheng Liu
In this paper, we first give the definition of the Euclidean sums of linear codes, and prove that the Euclidean sums of linear codes are Euclidean dual-containing. Then we construct two new classes of optimal asymmetric quantum error-correcting codes based on Euclidean sums of the Reed-Solomon codes, and two new classes of optimal asymmetric quantum error-correcting codes based on Euclidean sums of linear codes generated by Vandermonde matrices over finite fields. Moreover, these optimal asymmetric quantum error-correcting codes constructed in this paper are different from the ones in the literature.
Wuhan University Journal of Natural Sciences•Feb 1, 2024•0 citations