New asymmetric quantum codes from matrix-product codes.

In this paper, we provide the method of constructing asymmetric quantum codes by means of the Euclidean sums of matrix-product codes over finite fields. We construct asymmetric quantum codes of length 2n by using the Euclidean sums of matrix-product codes whose constituent codes are Reed–Solomon codes, and asymmetric quantum codes of length 3n by using the Euclidean sums of matrix-product codes whose constituent codes are generated by Fourier matrices. Using these constructions, concrete examples are presented to construct new asymmetric quantum codes. In addition, our obtained asymmetric quantum codes have better parameters than the ones available in the literature. [ABSTRACT FROM AUTHOR]